Total coloring graphs with large maximum degree
From MaRDI portal
Cites work
- A bound on the total chromatic number
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- An asymptotic version of the multigraph 1-factorization conjecture
- An upper bound for the total chromatic number of dense graphs
- Chromatic index of dense quasirandom graphs
- Graph edge coloring. Vizing's theorem and Goldberg's conjecture
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 3220175 (Why is no real title available?)
- scientific article; zbMATH DE number 3232667 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- Independent sets and 2‐factors in edge‐chromatic‐critical graphs
- Paths, Trees, and Flowers
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The core conjecture of Hilton and Zhao
- The Factorization of Linear Graphs
- The Solution of a Timetabling Problem
- The total chromatic number of graphs having large maximum degree
- The Total Chromatic Number of Graphs of High Minimum Degree
- The total chromatic number of regular graphs of even order and high degree
- The total chromatic number of regular graphs of high degree
- Total chromatic number of graphs of odd order and high degree
- Total colorings-a survey
This page was built for publication: Total coloring graphs with large maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6924612)
