Totally critical even order graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4108788 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 1052828 (Why is no real title available?)
- scientific article; zbMATH DE number 1146230 (Why is no real title available?)
- scientific article; zbMATH DE number 3215864 (Why is no real title available?)
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- 1-factorizing regular graphs of high degree - an improved bound
- A total-chromatic number analogue of Plantholt's theorem
- Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
- Determining the total colouring number is NP-hard
- The total chromatic number of graphs having large maximum degree
- Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
Cited in
(3)
This page was built for publication: Totally critical even order graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306315)