A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs

DOI10.1007/s00373-011-1087-1zbMath1256.05080OpenAlexW2083273337MaRDI QIDQ1928290

Hao Li, Yan Zhu, Gui Zhen Liu, Guang-Hui Wang

Publication date: 3 January 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-011-1087-1

zbMATH Keywords

color degreecolor neighborhoodheterochromatic cycle

Mathematics Subject Classification ID

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

Related Items (3)

Long rainbow paths and rainbow cycles in edge colored graphs. A survey ⋮ Rainbow cycles in edge-colored graphs ⋮ Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Color degree and heterochromatic cycles in edge-colored graphs
• Heterochromatic matchings in edge-colored graphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• Girth 5 graphs from relative difference sets
• Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
• Multicoloured Hamilton cycles
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Long heterochromatic paths in edge-colored graphs

This page was built for publication: A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs