Rainbow faces in edge‐colored plane graphs

DOI10.1002/jgt.20382zbMath1180.05045OpenAlexW4247304036MaRDI QIDQ3652543

Jozef Miškuf, Roman Soták, Erika Fecková Škrabuľáková, Stanlislav Jendroľ

Publication date: 18 December 2009

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

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

zbMATH Keywords

edge coloringfactorsrainbow coloringrainbowness

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Facially-constrained colorings of plane graphs: a survey ⋮ Planar anti-Ramsey numbers of matchings ⋮ Facial edge ranking of plane graphs ⋮ Anti-Ramsey problems for cycles ⋮ On rainbow-cycle-forbidding edge colorings of finite graphs ⋮ Facial visibility in edge colored plane graphs ⋮ Rainbow Numbers for Cycles in Plane Triangulations ⋮ Planar anti-Ramsey numbers of paths and cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rainbowness of cubic plane graphs
• Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs.
• Maximum face-constrained coloring of plane graphs
• On maximum face-constrained coloring of plane graphs with no short face cycles.
• Rainbow numbers for matchings and complete graphs
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Long heterochromatic paths in edge-colored graphs
• Complete graphs with no rainbow path
• On rainbowness of semiregular polyhedra
• Rainbow subgraphs in properly edge‐colored graphs
• Rainbow coloring the cube
• Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
• Constrained Ramsey numbers of graphs
• Multicolored trees in complete graphs

This page was built for publication: Rainbow faces in edge‐colored plane graphs