scientific article; zbMATH DE number 1123764
From MaRDI portal
Publication:4379734
Recommendations
- Graphs whose circular chromatic number equals the chromatic number
- scientific article; zbMATH DE number 4087686
- Chromatic numbers in some graphs
- On chromatic‐choosable graphs
- scientific article; zbMATH DE number 773170
- scientific article; zbMATH DE number 4085672
- scientific article; zbMATH DE number 4089574
- On chromatic equivalence of graphs
- Graphs with chromatic numbers strictly less than their colouring numbers
- On the chromatic number of graphs
Cited in
(25)- Ohba's conjecture is true for graphs with independence number at most three
- Choice number of 3-colorable elementary graphs
- On the choice number of claw-free perfect graphs
- Choice numbers of multi-bridge graphs
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
- Towards a version of Ohba's conjecture for improper colorings
- On choosability of some complete multipartite graphs and Ohba's conjecture
- Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
- Choice-perfect graphs
- On chromatic‐choosable graphs
- scientific article; zbMATH DE number 842014 (Why is no real title available?)
- On the choosability of claw-free perfect graphs
- A proof of a conjecture of Ohba
- Ohba's conjecture for graphs with independence number five
- Extremal decompositions for Nordhaus-Gaddum theorems
- Chromatic-choosability of hypergraphs with high chromatic number
- Chromatic choosability for some classes of perfect graphs
- Hall numbers of complete multipartite graphs, 2-trees, and wheels
- List rainbow connection number of graphs
- Minimum non-chromatic-choosable graphs with given chromatic number
- List-coloring claw-free graphs with small clique number
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\)
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4379734)
