Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs

DOI10.1016/j.disc.2012.11.024zbMath1277.05065OpenAlexW1976897610MaRDI QIDQ383748

Hao Li

Publication date: 6 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.11.024

zbMATH Keywords

color degreedirected cyclerainbow subgraphbipartite digraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three, Rainbow triangles in arc-colored digraphs, Color degree sum conditions for rainbow triangles in edge-colored graphs, Cycle extension in edge-colored complete graphs, Maximum properly colored trees in edge-colored graphs, On odd rainbow cycles in edge-colored graphs, Note on rainbow cycles in edge-colored graphs, Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs, Color degree sum conditions for properly colored spanning trees in edge-colored graphs, Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs, Rainbow cycles in edge-colored graphs, Rainbow triangles in edge-colored graphs, Properly edge-colored theta graphs in edge-colored complete graphs, Properly colored \(C_4\)'s in edge-colored graphs, Vertex-disjoint rainbow triangles in edge-colored graphs, Rainbow triangles and cliques in edge-colored graphs, Some rainbow cycles in \(r\)-good edge-colorings, Rainbow triangles in arc-colored tournaments, Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles, Properly colored short cycles in edge-colored graphs, Disproof of a conjecture on the rainbow triangles in arc-colored digraphs, On connectivities of edge-colored graphs, Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs, Note on rainbow triangles 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
• Unnamed Item
• Color degree and heterochromatic cycles in edge-colored graphs
• Rainbow generalizations of Ramsey theory: A survey
• Polychromatic Hamilton cycles
• Ryser's conjecture for tripartite 3-graphs
• A rainbow \(k\)-matching in the complete graph with \(r\) colors
• Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
• Directed triangles in digraphs
• Rainbow numbers for matchings and complete graphs
• Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs