On total coloring and equitable total coloring of infinite snark families
From MaRDI portal
Publication:6140969
DOI10.1051/RO/2023129MaRDI QIDQ6140969FDOQ6140969
Authors: Diana Sasaki, Simone Dantas
Publication date: 22 January 2024
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Recommendations
Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
- The hunting of a snark with total chromatic number 5
- On the total coloring of certain graphs
- The total-chromatic number of some families of snarks
- Title not available (Why is that?)
- On Total Chromatic Number of a Graph
- Snarks without small cycles
- On snarks that are far from being 3-edge colorable
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Construction of class two graphs with maximum vertex degree three
- Equitable total coloring of graphs with maximum degree 3
- On the equitable total chromatic number of cubic graphs
- Special classes of snarks
- Even-power of cycles with many vertices are type 1 total colorable
Cited In (3)
This page was built for publication: On total coloring and equitable total coloring of infinite snark families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140969)