Total coloring of some graph operations

DOI10.1007/978-3-031-52213-0_21MaRDI QIDQ6547840zbMATH OpenFDO

Authors T. Kavaskar, Sreelakshmi Sukumaran

Publication date 31 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-52213-0_21

zbMATH Keywords

join of graphstotal coloring conjecture

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• A bound on the total chromatic number
• Determining the total colouring number is NP-hard
• scientific article; zbMATH DE number 2077682 (Why is no real title available?)
• On total coloring of some classes of regular graphs
• Sur le coloriage des graphs
• The Colour Numbers of Complete Graphs
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Total chromatic number of generalized Mycielski graphs
• Total chromatic number of one kind of join graphs
• Total chromatic numbers
• Total coloring conjecture for certain classes of graphs
• Total colorings of product graphs
• Total colouring regular bipartite graphs is NP-hard
• Total colourings of Cartesian products
• Total colourings of graphs
• Total-Coloring of Plane Graphs with Maximum Degree Nine
• Vertex distinguishing equitable total chromatic number of join graphs
• Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.

This page was built for publication: Total coloring of some graph operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547840)