Total coloring of quasi-line graphs and inflated graphs
From MaRDI portal
Publication:5025132
Recommendations
Cites work
- scientific article; zbMATH DE number 4150186 (Why is no real title available?)
- A description of claw-free perfect graphs
- Determining the total colouring number is NP-hard
- Hadwiger's conjecture for quasi-line graphs
- Inflated graphs with equal independence number and upper irredundance number
- On Total Chromatic Number of a Graph
- On stable set polyhedra for K//(1,3)free graphs
- On the total coloring of certain graphs
- Recognizing claw-free perfect graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The stable set polytope of quasi-line graphs
- The structure of claw-free graphs
- The total chromatic number of any multigraph with maximum degree five is at most seven
- The total chromatic number of graphs having large maximum degree
- The total coloring of a multigraph with maximal degree 4
- Total colouring regular bipartite graphs is NP-hard
This page was built for publication: Total coloring of quasi-line graphs and inflated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5025132)