On total coloring and equitable total coloring of infinite snark families
From MaRDI portal
Publication:6140969
Recommendations
Cites work
- scientific article; zbMATH DE number 6472882 (Why is no real title available?)
- Construction of class two graphs with maximum vertex degree three
- Equitable total coloring of graphs with maximum degree 3
- Even-power of cycles with many vertices are type 1 total colorable
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- On Total Chromatic Number of a Graph
- On snarks that are far from being 3-edge colorable
- On the equitable total chromatic number of cubic graphs
- On the total coloring of certain graphs
- Snarks without small cycles
- Special classes of snarks
- The hunting of a snark with total chromatic number 5
- The total-chromatic number of some families of snarks
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)