An upper bound for total colouring of graphs
From MaRDI portal
Publication:686500
DOI10.1016/0012-365X(93)90175-SzbMATH Open0786.05035OpenAlexW2063433483MaRDI QIDQ686500FDOQ686500
Authors: Abdón Sánchez-Arroyo, Colin McDiarmid 
Publication date: 25 April 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90175-s
Recommendations
Cites Work
- On total colourings of graphs
- On the total coloring of certain graphs
- Title not available (Why is that?)
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Title not available (Why is that?)
- An upper bound for the total chromatic number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complementary Graphs and Edge Chromatic Numbers
- Path-Partition Structures of Graphs and Digraphs
Cited In (18)
- An upper bound for the total chromatic number of dense graphs
- Total chromatic number of generalized Mycielski graphs
- Title not available (Why is that?)
- Bounds for mean colour numbers of graphs
- A new upper bound for total colourings of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring
- An upper bound for van der Waerden-like numbers using \(k\) colors
- The total chromatic number of graphs having large maximum degree
- An Upper Bound for List T -Colourings
- Bounded Max-colorings of Graphs
- Fractionally colouring total graphs
- Title not available (Why is that?)
- Total Thue colourings of graphs
- Title not available (Why is that?)
- Simultaneously colouring the edges and faces of plane 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)
