17 research outputs found
Covering minimal separators and potential maximal cliques in -free graphs
A graph is called -free} if it does not contain a -vertex path as an
induced subgraph. While -free graphs are exactly cographs, the structure
of -free graphs for remains little understood. On one hand,
classic computational problems such as Maximum Weight Independent Set (MWIS)
and -Coloring are not known to be NP-hard on -free graphs for any fixed
. On the other hand, despite significant effort, polynomial-time algorithms
for MWIS in -free graphs~[SODA 2019] and -Coloring in -free
graphs~[Combinatorica 2018] have been found only recently. In both cases, the
algorithms rely on deep structural insights into the considered graph classes.
One of the main tools in the algorithms for MWIS in -free graphs~[SODA
2014] and in -free graphs~[SODA 2019] is the so-called Separator Covering
Lemma that asserts that every minimal separator in the graph can be covered by
the union of neighborhoods of a constant number of vertices. In this note we
show that such a statement generalizes to -free graphs and is false in
-free graphs. We also discuss analogues of such a statement for covering
potential maximal cliques with unions of neighborhoods
-Critical Graphs in -Free Graphs
Given two graphs and , a graph is -free if it
contains no induced subgraph isomorphic to or . Let be the
path on vertices. A graph is -vertex-critical if has chromatic
number but every proper induced subgraph of has chromatic number less
than . The study of -vertex-critical graphs for graph classes is an
important topic in algorithmic graph theory because if the number of such
graphs that are in a given hereditary graph class is finite, then there is a
polynomial-time algorithm to decide if a graph in the class is
-colorable.
In this paper, we initiate a systematic study of the finiteness of
-vertex-critical graphs in subclasses of -free graphs. Our main result
is a complete classification of the finiteness of -vertex-critical graphs in
the class of -free graphs for all graphs on 4 vertices. To obtain
the complete dichotomy, we prove the finiteness for four new graphs using
various techniques -- such as Ramsey-type arguments and the dual of Dilworth's
Theorem -- that may be of independent interest.Comment: 18 page
Note on 3-Coloring of -Free Graphs
We show that the 3-coloring problem is polynomial-time solvable on
-free graphs.Comment: 17 pages, 13 figure
Colouring H-free graphs of bounded diameter.
The Colouring problem is to decide if the vertices of a graph can be coloured with at most k colours for an integer k, such that no two adjacent vertices are coloured alike. A graph G is H-free if G does not contain H as an induced subgraph. It is known that Colouring is NP-complete for H-free graphs if H contains a cycle or claw, even for fixed k ≥3. We examine to what extent the situation may change if in addition the input graph has bounded diameter
Three-coloring and list three-coloring of graphs without induced paths on seven vertices
In this paper we present a polynomial time algorithm that determines if an input graph containing no induced seven-vertex path is 3-colorable. This affirmatively answers a question posed by Randerath, Schiermeyer and Tewes in 2002. Our algorithm also solves the list-coloring version of the 3-coloring problem, where every vertex is assigned a list of colors that is a subset of {1,2,3}, and gives an explicit coloring if one exists.Fil: Bonomo, Flavia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Chudnovsky, Mariana. University of Princeton; Estados UnidosFil: Maceli, Peter. Canisius College; Estados UnidosFil: Schaudt, Oliver. Universitat zu Köln; AlemaniaFil: Stein, Maya. Universidad de Chile; ChileFil: Zhong, Mingxian. Columbia University; Estados Unido