Color degree and heterochromatic cycles in edge-colored graphs

DOI10.1016/j.ejc.2012.06.005zbMath1248.05071OpenAlexW1966830182MaRDI QIDQ449221

Hao Li, Guang-Hui Wang

Publication date: 12 September 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.06.005

zbMATH Keywords

rainbow subgraphmulticolored subgraph

Mathematics Subject Classification ID

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

Related Items (24)

Rainbow triangles in arc-colored digraphs ⋮ Existence of rainbow matchings in strongly edge-colored graphs ⋮ Vertex-disjoint rainbow cycles in edge-colored graphs ⋮ Edge-disjoint rainbow triangles in edge-colored graphs ⋮ Color degree sum conditions for rainbow triangles in edge-colored graphs ⋮ A note on rainbow matchings in strongly edge-colored graphs ⋮ Maximum properly colored trees in edge-colored graphs ⋮ On odd rainbow cycles in edge-colored graphs ⋮ Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs ⋮ A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs ⋮ Note on rainbow cycles in edge-colored graphs ⋮ Long rainbow paths and rainbow cycles in edge colored graphs. A survey ⋮ Edge-disjoint properly colored cycles in edge-colored complete graphs ⋮ Rainbow cycles in edge-colored graphs ⋮ Rainbow triangles in edge-colored graphs ⋮ \(f\)-class two graphs whose \(f\)-cores have maximum degree two ⋮ Properly colored \(C_4\)'s in edge-colored graphs ⋮ Vertex-disjoint rainbow triangles in edge-colored graphs ⋮ Some rainbow cycles in \(r\)-good edge-colorings ⋮ The heterochromatic cycles in edge-colored graphs ⋮ Disproof of a conjecture on the rainbow triangles in arc-colored digraphs ⋮ Orthogonal matchings revisited ⋮ Note on rainbow triangles in edge-colored graphs ⋮ Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study

Cites Work

• Polychromatic Hamilton cycles
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Directed triangles in digraphs
• Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Long heterochromatic paths in edge-colored graphs
• Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
• A lower bound for the length of a partial transversal in a Latin square
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Color degree and heterochromatic cycles in edge-colored graphs