On total coloring and equitable total coloring of infinite snark families

DOI10.1051/ro/2023129MaRDI QIDQ6140969

Diana Sasaki, Unnamed Author, Unnamed Author, Simone Dantas

Publication date: 22 January 2024

Published in: RAIRO - Operations Research (Search for Journal in Brave)

zbMATH Keywords

superpositiontotal coloringequitable total coloringblowup snarkssemiblowup snarks

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• On snarks that are far from being 3-edge colorable
• On the equitable total chromatic number of cubic graphs
• The total-chromatic number of some families of snarks
• Construction of class two graphs with maximum vertex degree three
• Special classes of snarks
• Equitable total coloring of graphs with maximum degree 3
• Snarks without small cycles
• Even-power of cycles with many vertices are type 1 total colorable
• The hunting of a snark with total chromatic number 5
• On the total coloring of certain graphs
• On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• On Total Chromatic Number of a Graph

This page was built for publication: On total coloring and equitable total coloring of infinite snark families