Rainbow faces in edge‐colored plane graphs

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

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

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 coloring; factors; rainbow coloring; rainbowness

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

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