On 2-Subcolourings of Chordal Graphs
From MaRDI portal
Publication:5458558
DOI10.1007/978-3-540-78773-0_47zbMATH Open1136.68470OpenAlexW1493037708MaRDI QIDQ5458558FDOQ5458558
Authors: Juraj Stacho 
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_47
Recommendations
- 2-tone coloring of chordal and outerplanar graphs
- scientific article; zbMATH DE number 1002208
- scientific article; zbMATH DE number 742642
- Subcolorings and the subchromatic number of a graph
- scientific article; zbMATH DE number 52166
- Partial Grundy coloring in some subclasses of bipartite graphs and chordal graphs
- Chromatic bounds for the subclasses of \(pK_2\)-free graphs
- Chordal multipartite graphs and chordal colorings
- On 2-colorings of hypergraphs
- On the chromatic number of a graph with two forbidden subgraphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Efficient graph representations
- Partitioning chordal graphs into independent sets and cliques
- The subchromatic number of a graph
- List matrix partitions of chordal graphs
- More about subcolorings
- Subcolorings and the subchromatic number of a graph
- The complexity of \(G\)-free colourability
- Title not available (Why is that?)
Cited In (10)
- Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)
- Title not available (Why is that?)
- Approximating maximum weight \(K\)-colorable subgraphs in chordal graphs
- Solving partition problems almost always requires pushing many vertices around
- Title not available (Why is that?)
- The maximum k-colorable subgraph problem for chordal graphs
- Largest chordal and interval subgraphs faster than \(2^n\)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
- On efficient coloring of chordless graphs
- Title not available (Why is that?)
This page was built for publication: On 2-Subcolourings of Chordal Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458558)
