Total coloring of quasi-line graphs and inflated graphs
From MaRDI portal
Publication:5025132
DOI10.1142/S1793830921500609zbMath1478.05056OpenAlexW3107967071MaRDI QIDQ5025132
No author found.
Publication date: 1 February 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921500609
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- The total chromatic number of graphs having large maximum degree
- Determining the total colouring number is NP-hard
- The stable set polytope of quasi-line graphs
- Recognizing claw-free perfect graphs
- On stable set polyhedra for K//(1,3)free graphs
- The total coloring of a multigraph with maximal degree 4
- A description of claw-free perfect graphs
- Total colouring regular bipartite graphs is NP-hard
- The total chromatic number of any multigraph with maximum degree five is at most seven
- On the total coloring of certain graphs
- Hadwiger's conjecture for quasi-line graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- On Total Chromatic Number of a Graph
- Inflated graphs with equal independence number and upper irredundance number
This page was built for publication: Total coloring of quasi-line graphs and inflated graphs