Planar graph colorings without short monochromatic cycles

DOI10.1002/JGT.10167zbMATH Open1042.05044OpenAlexW4254558262MaRDI QIDQ4736767FDOQ4736767

Riste Škrekovski, Tomáš Kaiser

Publication date: 6 August 2004

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10167

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

zbMATH Keywords

graph coloringarboricityplanar graph2-factormonochromatic cycle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites Work

• B-sets and planar maps

Cited In (7)

• Disjoint total dominating sets in near‐triangulations
• Total coloring of planar graphs without chordal short cycles
• Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
• Planar graphs without normally adjacent short cycles
• Three-coloring planar graphs without short cycles
• Incidence coloring of planar graphs without adjacent small cycles
• Short proofs of coloring theorems on planar graphs

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)