Rainbow C₃'s and C₄'s in edge-colored graphs
DOI10.1016/J.DISC.2012.11.024zbMATH Open1277.05065OpenAlexW1976897610MaRDI QIDQ383748FDOQ383748
Authors: 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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Graph theory with applications
- Title not available (Why is that?)
- Color degree and heterochromatic cycles in edge-colored graphs
- Polychromatic Hamilton cycles
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- Rainbow numbers for matchings and complete graphs
- Rainbow generalizations of Ramsey theory: A survey
- Ryser's conjecture for tripartite 3-graphs
- Title not available (Why is that?)
- Directed triangles in digraphs
- Title not available (Why is that?)
- Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs
- Color degree and heterochromatic matchings in edge-colored bipartite graphs
Cited In (31)
- On odd rainbow cycles in edge-colored graphs
- Note on rainbow cycles in edge-colored graphs
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles
- On connectivities of edge-colored graphs
- Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
- Properly edge-colored theta graphs in edge-colored complete graphs
- Proper cycles and rainbow cycles in 2-triangle-free edge-colored complete graphs
- Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s 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
- Proper edge colorings of Cartesian products with rainbow \(C_4\)-s
- Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three
- The minimum color degree and a large rainbow cycle in an edge-colored graph.
- Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
- Rainbow cliques in edge-colored graphs
- Rainbow triangles in arc-colored tournaments
- Rainbow triangles in edge-colored graphs
- Rainbow cycles in edge-colored graphs
- Color degree sum conditions for rainbow triangles in edge-colored graphs
- Counting rainbow triangles in edge-colored graphs
- Properly colored short cycles in edge-colored graphs
- Cycle extension in edge-colored complete graphs
- More on rainbow cliques in edge-colored graphs
- Color degree sum conditions for properly colored spanning trees in edge-colored graphs
- Title not available (Why is that?)
- Maximum properly colored trees in edge-colored graphs
- Some rainbow cycles in \(r\)-good edge-colorings
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
- Note on rainbow triangles in edge-colored graphs
- Rainbow triangles in arc-colored digraphs
This page was built for publication: Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383748)
