Total colorings of planar graphs without intersecting 5-cycles
From MaRDI portal
Publication:444447
Recommendations
- Total colorings of planar graphs without intersecting 4-cycles and intersecting 5-cycles
- Total colorings of planar graphs without 5-cycles and adjacent 6-cycles
- scientific article; zbMATH DE number 6795582
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- Total colorings of planar graphs without adjacent 5-cycles.
Cites work
- A note on total colorings of planar graphs without 4-cycles
- Graph theory
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
- 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
- Total coloring of planar graphs with maximum degree \(7\)
- Total coloring of planar graphs without 6-cycles
- Total coloring of planar graphs without adjacent short cycles
- Total coloring of planar graphs without chordal short cycles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- 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 with maximum degree seven and without intersecting 3-cycles
- Total colourings of graphs
- Total colourings of planar graphs with large girth
- Total-Coloring of Plane Graphs with Maximum Degree Nine
Cited in
(10)- Total colorings of planar graphs with sparse triangles
- Total colorings-a survey
- Total coloring of planar graphs without chordal 7-cycles
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Total coloring of planar graphs without short cycles
- On \((p,1)\)-total labelling of planar graphs
- Total colorings of planar graphs without intersecting 4-cycles and intersecting 5-cycles
- Total colorings of planar graphs without 5-cycles and adjacent 6-cycles
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles
- A matrix approach to hypergraph stable set and coloring problems with its application to storing problem
This page was built for publication: Total colorings of planar graphs without intersecting 5-cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q444447)
