Planar graph colorings without short monochromatic cycles
From MaRDI portal
Publication:4736767
Recommendations
- Total coloring of planar graphs without short cycles
- Total coloring of planar graphs without adjacent short cycles
- Total coloring of planar graphs without chordal short cycles
- Acyclic edge colouring of planar graphs without short cycles
- Strong edge-coloring of planar graphs without short cycles
- Total colorings of planar graphs without small cycles
- On 3-colorable planar graphs without short cycles
- \(r\)-hued coloring of planar graphs without short cycles
- Total coloring of planar graphs without some adjacent cycles
- Three-coloring planar graphs without short cycles
Cites work
Cited in
(12)- Short proofs of coloring theorems on planar graphs
- Planar Ramsey graphs
- Disjoint total dominating sets in near‐triangulations
- Three-coloring planar graphs without short cycles
- Colorings of plane graphs without long monochromatic facial paths
- Planar graphs without normally adjacent short cycles
- Splitting planar graphs of girth 6 into two linear forests with short paths
- Planar digraphs of digirth four are 2-colorable
- Incidence coloring of planar graphs without adjacent small cycles
- Total coloring of planar graphs without chordal short cycles
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- 2-list-coloring planar graphs without monochromatic triangles
This page was built for publication: Planar graph colorings without short monochromatic cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736767)
