Total coloring of some graph operations
From MaRDI portal
Publication:6547840
DOI10.1007/978-3-031-52213-0_21MaRDI QIDQ6547840
T. Kavaskar, Sreelakshmi Sukumaran
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Total chromatic number of generalized Mycielski graphs
- Determining the total colouring number is NP-hard
- Total chromatic numbers
- A bound on the total chromatic number
- Total colouring regular bipartite graphs is NP-hard
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.
- Total colorings of product graphs
- Total colourings of graphs
- On total coloring of some classes of regular graphs
- Total coloring conjecture for certain classes of graphs
- Vertex distinguishing equitable total chromatic number of join graphs
- Total chromatic number of one kind of join graphs
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- Total colourings of Cartesian products
- The Colour Numbers of Complete Graphs
- Sur le coloriage des graphs
This page was built for publication: Total coloring of some graph operations
