The total-chromatic number of some families of snarks
From MaRDI portal
Publication:536223
DOI10.1016/J.DISC.2011.02.013zbMATH Open1222.05049OpenAlexW2042779161MaRDI QIDQ536223FDOQ536223
Authors: C. N. Campos, Simone Dantas, Célia P. de Mello 
Publication date: 16 May 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.02.013
Recommendations
Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
- The circular chromatic index of Goldberg snarks
- On the total coloring of certain graphs
- On Total Chromatic Number of a Graph
- Determining the total colouring number is NP-hard
- Construction of class two graphs with maximum vertex degree three
- Total colouring regular bipartite graphs is NP-hard
- Special classes of snarks
- The total chromatic number of some bipartite graphs.
Cited In (12)
- On total coloring and equitable total coloring of infinite snark families
- Title not available (Why is that?)
- On the total coloring of generalized Petersen graphs
- 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
- Total chromatic number of some families of graphs with maximum degree 3
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)
