Total coloring of some graph operations
From MaRDI portal
Publication:6547840
DOI10.1007/978-3-031-52213-0_21MaRDI QIDQ6547840FDOQ6547840
Authors: T. Kavaskar, Sreelakshmi Sukumaran 
Publication date: 31 May 2024
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
- Sur le coloriage des graphs
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colourings of graphs
- Total chromatic number of one kind of join graphs
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- Determining the total colouring number is NP-hard
- The Colour Numbers of Complete Graphs
- Total colouring regular bipartite graphs is NP-hard
- Title not available (Why is that?)
- Vertex distinguishing equitable total chromatic number of join graphs
- Total chromatic number of generalized Mycielski graphs
- A bound on the total chromatic number
- Total coloring conjecture for certain classes of graphs
- Total colorings of product graphs
- Total chromatic numbers
- Total colourings of Cartesian products
- Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.
- On total coloring of some classes of regular graphs
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)
