The total chromatic number of split-indifference graphs
From MaRDI portal
(Redirected from Publication:442393)
Recommendations
Cites work
- A total-chromatic number analogue of Plantholt's theorem
- Characterizing and edge-colouring split-indifference graphs
- Determining the total colouring number is NP-hard
- Edge and total coloring of interval graphs
- scientific article; zbMATH DE number 749267 (Why is no real title available?)
- On edge-colouring indifference graphs
- On the compatibility between a graph and a simple order
- The Colour Numbers of Complete Graphs
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total colouring regular bipartite graphs is NP-hard
- Total-chromatic number and chromatic index of dually chordal graphs
Cited in
(12)- Total coloring of rooted path graphs
- Complexity-separating graph classes for vertex, edge and total colouring
- Edge-colouring and total-colouring chordless graphs
- scientific article; zbMATH DE number 749267 (Why is no real title available?)
- Total chromatic number of honeycomb network
- Equitable total chromatic number of splitting graph
- Counting and enumerating unlabeled split-indifference graphs
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
- Total colorings-a survey
- Total coloring in some split-comparability graphs
- New results on edge-coloring and total-coloring of split graphs
- Chromatic index under parameterized settings
This page was built for publication: The total chromatic number of split-indifference graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442393)
