On the coequal values of total chromatic number and chromatic index
From MaRDI portal
Publication:2101175
DOI10.1016/J.JCTB.2022.10.006zbMath1502.05059OpenAlexW4308422265MaRDI QIDQ2101175
Publication date: 28 November 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2022.10.006
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Cites Work
- A bound on the total chromatic number
- Edge-coloring of multigraphs: Recoloring technique
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- Probability Inequalities for Sums of Bounded Random Variables
- A Theorem on Coloring the Lines of a Network
- Graph colouring and the probabilistic method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the coequal values of total chromatic number and chromatic index