scientific article; zbMATH DE number 2230325
From MaRDI portal
Publication:5708621
zbMath1075.05582MaRDI QIDQ5708621
Jaroslav Nešetřil, John G. Gimbel
Publication date: 18 November 2005
Full work available at URL: http://www.sciencedirect.com/science/journal/15710653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions ⋮ Some defective parameters in graphs ⋮ On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering and domination in perfect 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
- A Linear Recognition Algorithm for Cographs
- 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
- On chromatic number of finite set-systems
