The total-chromatic number of some families of snarks
From MaRDI portal
(Redirected from Publication:536223)
Recommendations
Cites work
- Construction of class two graphs with maximum vertex degree three
- Determining the total colouring number is NP-hard
- On Total Chromatic Number of a Graph
- On the total coloring of certain graphs
- Special classes of snarks
- The circular chromatic index of Goldberg snarks
- The total chromatic number of some bipartite graphs.
- Total colouring regular bipartite graphs is NP-hard
Cited in
(12)- Total chromatic number of some families of graphs with maximum degree 3
- On the total coloring of generalized Petersen graphs
- On total coloring and equitable total coloring of infinite snark families
- scientific article; zbMATH DE number 6472882 (Why is no real title available?)
- Total colorings-a survey
- Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs
- On total coloring of snark products
- On the equitable total chromatic number of cubic graphs
- Petersen-colorings and some families of snarks
- The hunting of a snark with total chromatic number 5
- On the pebbling numbers of flower, Blanuša and Watkins snarks
- On coloring problems of snark families
This page was built for publication: The total-chromatic number of some families of snarks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q536223)