Discrete Applied Mathematics
Chromatic index of graphs with no cycle with a unique chord
Theoretical Computer Science
Graphs of separability at most two: structural characterizations and their consequences
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Combinatorial optimization with 2-joins
Journal of Combinatorial Theory Series B
Graphs of separability at most 2
Discrete Applied Mathematics
Clique-Colouring and biclique-colouring unichord-free graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
On graphs with no induced subdivision of K4
Journal of Combinatorial Theory Series B
Excluding Induced Subdivisions of the Bull and Related Graphs
Journal of Graph Theory
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
Decomposition of even-hole-free graphs with star cutsets and 2-joins
Journal of Combinatorial Theory Series B
Complexity of colouring problems restricted to unichord-free and { square,unichord }-free graphs
Discrete Applied Mathematics
Hi-index | 0.00 |
We give a structural description of the class 𝒞 of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in 𝒞 is either in some simple basic class or has a decomposition. Basic classes are chordless cycles, cliques, bipartite graphs with one side containing only nodes of degree 2 and induced subgraphs of the famous Heawood or Petersen graph. Decompositions are node cutsets consisting of one or two nodes and edge cutsets called 1-joins. Our decomposition theorem actually gives a complete structure theorem for 𝒞, i.e. every graph in 𝒞 can be built from basic graphs that can be explicitly constructed, and gluing them together by prescribed composition operations, and all graphs built this way are in 𝒞. This has several consequences: an 𝒪(nm) -time algorithm to decide whether a graph is in 𝒞, an 𝒪(n+ m) -time algorithm that finds a maximum clique of any graph in 𝒞, and an 𝒪(nm) -time coloring algorithm for graphs in 𝒞. We prove that every graph in 𝒞 is either 3-colorable or has a coloring with ω colors where ω is the size of a largest clique. The problem of finding a maximum stable set for a graph in 𝒞 is known to be NP-hard. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 31–67, 2010