DAM 2010 - PDF Preprint Papers

DAM 2010

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DAM-2010 Paper

click to vote

DAM
2010

167views more DAM 2010»

A new characterization of P6-free graphs

13 years 11 months ago

Download folk.uib.no

We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...

Pim van 't Hof, Daniël Paulusma

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	167	A new characterization of P6-free graphs	claim
2	159	Approximation algorithms for art gallery problems in polygons	claim
3	137	H-join decomposable graphs and algorithms with runtime single exponential in rankwidth	claim
4	132	Homomorphisms of 2-edge-colored graphs	claim
5	120	A new approximation algorithm for the multilevel facility location problem	claim
6	116	Minimum sum edge colorings of multicycles	claim
7	112	New results on optimizing rooted triplets consistency	claim
8	111	Covering line graphs with equivalence relations	claim
9	107	Codes from lattice and related graphs, and permutation decoding	claim
10	105	An iterative approach to graph irregularity strength	claim
11	104	Sorting with networks of data structures	claim
12	103	Dynamic list coloring of bipartite graphs	claim
13	101	On the distribution of distances between specified nodes in increasing trees	claim
14	101	Tighter bounds of the First Fit algorithm for the bin-packing problem	claim
15	99	Backbone colorings of graphs with bounded degree	claim
16	95	Excessive factorizations of bipartite multigraphs	claim
17	94	The Banzhaf power index for ternary bicooperative games	claim
18	94	A polyhedral study of triplet formulation for single row facility layout problem	claim
19	92	Average-case analysis of incremental topological ordering	claim
20	92	Enumeration of matchings in families of self-similar graphs	claim
21	89	A note on the hardness of Skolem-type sequences	claim
22	86	Minimum fill-in and treewidth of split+ke and split+kv graphs	claim
23	86	The clique operator on circular-arc graphs	claim
24	84	Covering a laminar family by leaf to leaf links	claim
25	83	Interlace polynomials: Enumeration, unimodality and connections to codes	claim
26	81	Parallel cleaning of a network with brushes	claim
27	81	The k-in-a-tree problem for graphs of girth at least k	claim
28	80	On shortest crucial words avoiding abelian powers	claim
29	79	On the sum minimization version of the online bin covering problem	claim
30	66	On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width	claim
31	64	Network flow interdiction on planar graphs	claim
32	62	On orthogonal ray graphs	claim
33	61	A note on the acyclic 3-choosability of some planar graphs	claim
34	60	One-to-many node-disjoint paths in (n, k)-star graphs	claim
35	59	Local edge-connectivity augmentation in hypergraphs is NP-complete	claim
36	58	Finding the maximum and minimum elements with one lie	claim
37	57	Enumeration of polyominoes inscribed in a rectangle	claim
38	56	Crossing minimization in extended level drawings of graphs	claim
39	56	Covering and radius-covering arrays: Constructions and classification	claim
40	54	An implicit representation of chordal comparability graphs in linear time	claim
41	53	Minimum cut bases in undirected networks	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers