Partitions of graphs into cographs
From MaRDI portal
Publication:607000
DOI10.1016/j.disc.2010.07.011zbMath1209.05181OpenAlexW2105861762MaRDI QIDQ607000
Jaroslav Nešetřil, John G. Gimbel
Publication date: 19 November 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.07.011
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Note on strong product graph dimension ⋮ Dynamic \(F\)-free coloring of graphs ⋮ Colorings of oriented planar graphs avoiding a monochromatic subgraph ⋮ On the computational complexity of the bipartizing matching problem ⋮ Classes of graphs with low complexity: the case of classes with bounded linear rankwidth ⋮ Representing graphs as the intersection of cographs and threshold graphs ⋮ Vertex Partitions of Graphs into Cographs and Stars
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(P_4\)-transversals of chordal graphs
- Chromatically optimal rigid graphs
- Complement reducible graphs
- Some simplified NP-complete graph problems
- A short proof of the existence of highly chromatic hypergraphs without short cycles
- On cocolourings and cochromatic numbers of graphs
- The complexity of \(G\)-free colourability
- Colorings and girth of oriented planar graphs
- The subchromatic number of a graph
- Gadget classification
- On a property of the class of n-colorable graphs
- Defective coloring revisited
- Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
- Some extremal results in cochromatic and dichromatic theory
- Coloring graphs with fixed genus and girth
- Probability Inequalities for Sums of Bounded Random Variables
- On Injective Colourings of Chordal Graphs
- On chromatic number of finite set-systems
