An upper bound for total colouring of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4134070 (Why is no real title available?)
- scientific article; zbMATH DE number 3659620 (Why is no real title available?)
- scientific article; zbMATH DE number 3523580 (Why is no real title available?)
- scientific article; zbMATH DE number 3349876 (Why is no real title available?)
- An upper bound for the total chromatic number
- Complementary Graphs and Edge Chromatic Numbers
- On the total coloring of certain graphs
- On total colourings of graphs
- Path-Partition Structures of Graphs and Digraphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
Cited in
(18)- scientific article; zbMATH DE number 62433 (Why is no real title available?)
- An upper bound for the total chromatic number of dense graphs
- scientific article; zbMATH DE number 29786 (Why is no real title available?)
- scientific article; zbMATH DE number 842882 (Why is no real title available?)
- An Upper Bound for List T -Colourings
- scientific article; zbMATH DE number 426349 (Why is no real title available?)
- Total chromatic number of generalized Mycielski graphs
- The total chromatic number of graphs having large maximum degree
- An upper bound for van der Waerden-like numbers using \(k\) colors
- scientific article; zbMATH DE number 169493 (Why is no real title available?)
- Fractionally colouring total graphs
- Simultaneously colouring the edges and faces of plane graphs
- A new upper bound for total colourings of graphs
- Total Thue colourings of graphs
- Bounded Max-colorings of Graphs
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
- Bounds for mean colour numbers of graphs
This page was built for publication: An upper bound for total colouring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686500)
