Total coloring of planar graphs without 6-cycles
From MaRDI portal
Recommendations
- Total colorings of planar graphs without 5-cycles and adjacent 6-cycles
- Total colorings of planar graphs without chordal 6-cycles
- Total coloring of planar graphs without short cycles
- Total colorings of planar graphs without 6-cycles and adjacent 5-cycles
- Total colorings of planar graphs without small cycles
Cites work
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- A note on total colorings of planar graphs without 4-cycles
- Determining the total colouring number is NP-hard
- List edge and list total colorings of planar graphs without short cycles
- On Total Chromatic Number of a Graph
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- On the total coloring of certain graphs
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- The total chromatic number of any multigraph with maximum degree five is at most seven
- The total coloring of a multigraph with maximal degree 4
- Total chromatic number of planar graphs with maximum degree ten
- Total colorings of planar graphs with large maximum degree
- Total colorings of planar graphs with maximum degree at least 8
- Total colorings of planar graphs without adjacent triangles
- Total colorings of planar graphs without small cycles
- Total colourings of graphs
- Total colourings of planar graphs with large girth
Cited in
(27)- A note on total colorings of planar graphs without 4-cycles
- Minimum total coloring of planar graph
- Total coloring of planar graphs without chordal 7-cycles
- Total colorings of planar graphs without small cycles
- Total colorings of planar graphs with sparse short cycles
- Total coloring of planar graphs with maximum degree 8
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Total colorings of planar graphs without intersecting 5-cycles
- Total coloring of planar graphs without chordal short cycles
- Total colorings-a survey
- Total coloring of planar graphs without short cycles
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Total colorings of planar graphs without 5-cycles and adjacent 6-cycles
- A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
- scientific article; zbMATH DE number 2219803 (Why is no real title available?)
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
- On total chromatic number of planar graphs without 4-cycles
- Acyclic total colorings of planar graphs without \(l\) cycles
- Total coloring of planar graphs without some chordal 6-cycles
- Total colorings of planar graphs without chordal 6-cycles
- Total coloring of plane graphs with maximum degree six and without intersecting triangles and 4-cycles
- On graph proper total colorings with labelling-type restrictions
- Total coloring of planar graphs without adjacent chordal 6-cycles
- Acyclic list edge coloring of graphs with maximum degree 4
- Total colorings of planar graphs without 6-cycles and adjacent 5-cycles
- Total coloring of planar graphs without some adjacent cycles
This page was built for publication: Total coloring of planar graphs without 6-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617651)
