Colouring H-free graphs of bounded diameter.
From MaRDI portal
Recommendations
Cites work
- \(H\)-colouring \(P_t\)-free graphs in subexponential time
- A survey on the computational complexity of coloring graphs with forbidden subgraphs
- Algorithms and almost tight results for 3-colorability of small diameter graphs
- Coloring graphs with forbidden induced subgraphs
- Colouring (P_r+P_s)-Free Graphs
- Colouring graphs when the number of colours is almost the maximum degree
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- Filling the complexity gaps for colouring planar and bounded degree graphs
- Four-coloring \(P_6\)-free graphs
- Graph colorings with local constraints -- a survey
- Hard coloring problems in low degree planar bipartite graphs
- scientific article; zbMATH DE number 446487 (Why is no real title available?)
- scientific article; zbMATH DE number 3882470 (Why is no real title available?)
- scientific article; zbMATH DE number 3503283 (Why is no real title available?)
- scientific article; zbMATH DE number 1341914 (Why is no real title available?)
- scientific article; zbMATH DE number 2044943 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 3412694 (Why is no real title available?)
- Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
- List 3-coloring graphs with no induced \(P_6 + rP_3\)
- NP completeness of finding the chromatic index of regular graphs
- On Moore Graphs with Diameters 2 and 3
- Open problems on graph coloring for special graph classes
- The complexity of colouring problems on dense graphs
- The complexity of satisfiability problems
- The NP-Completeness of Edge-Coloring
- There is No Irregular Moore Graph
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices
- Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
- Vertex colouring and forbidden subgraphs -- a survey
Cited in
(16)- Dichotomy for bounded degree \(H\)-colouring
- Hard problems that quickly become very easy
- Few induced disjoint paths for \(H\)-free graphs
- Partitioning \(H\)-free graphs of bounded diameter
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
- \(H\)-free coloring on graphs with bounded tree-width
- Colouring diamond-free graphs
- Steiner trees for hereditary graph classes: a treewidth perspective
- Faster 3-coloring of small-diameter graphs
- Colouring graphs of bounded diameter in the absence of small cycles
- Acyclic, star, and injective colouring: bounding the diameter
- Acyclic, star, and injective colouring: bounding the diameter
- Colouring graphs of bounded diameter in the absence of small cycles
- Making an H H‐free graph k k‐colorable
- 3-coloring C₄ or C₃-free diameter two graphs
- \(C_{2k+1}\)-coloring of bounded-diameter graphs
This page was built for publication: Colouring H-free graphs of bounded diameter.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092372)
