Color degree and heterochromatic cycles in edge-colored graphs
From MaRDI portal
Publication:449221
DOI10.1016/J.EJC.2012.06.005zbMATH Open1248.05071OpenAlexW1966830182MaRDI QIDQ449221FDOQ449221
Authors: Hao Li, Guanghui 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
Recommendations
- Color degree and alternating cycles in edge-colored graphs
- The heterochromatic cycles in edge-colored graphs
- Color degree and heterochromatic paths in edge-colored graphs.
- Cycles and paths in edge‐colored graphs with given degrees
- Color degree and heterochromatic matchings in edge-colored bipartite graphs
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
- The heterochromatic girth in edge-colored graphs
- Cycles in color-critical graphs
- Alternating cycles in edge-colored graphs
- Edge-colored complete graphs with alternating cycles
Cites Work
- Graph theory
- A lower bound for the length of a partial transversal in a Latin square
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Long heterochromatic paths in edge-colored graphs
- Title not available (Why is that?)
- Polychromatic Hamilton cycles
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Title not available (Why is that?)
- Directed triangles in digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Color degree and heterochromatic matchings in edge-colored bipartite graphs
- Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
Cited In (34)
- On odd rainbow cycles in edge-colored graphs
- Note on rainbow cycles in edge-colored graphs
- Paths and cycles in colored graphs
- Rainbow \(C_4\)'s and directed \(C_4\)'s: the bipartite case study
- Rainbow \(C_3\)'s and \(C_4\)'s 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
- Colouring of cycles in the de bruijn graphs
- Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
- Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
- Existence of rainbow matchings in strongly edge-colored graphs
- Orthogonal matchings revisited
- Vertex-disjoint rainbow cycles in edge-colored graphs
- A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs
- A note on rainbow matchings in strongly edge-colored graphs
- The heterochromatic cycles in edge-colored graphs
- Rainbow triangles in edge-colored graphs
- A linear heterochromatic number of graphs
- Rainbow cycles in edge-colored graphs
- Color degree sum conditions for rainbow triangles in edge-colored graphs
- The heterochromatic girth in edge-colored graphs
- Counting rainbow triangles in edge-colored graphs
- Color degree and heterochromatic paths in edge-colored graphs.
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey
- Cycles in color-critical graphs
- Edge-disjoint rainbow triangles in edge-colored graphs
- Maximum properly colored trees in edge-colored graphs
- Some rainbow cycles in \(r\)-good edge-colorings
- Cycles and paths in edge‐colored graphs with given degrees
- 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
- Edge-disjoint properly colored cycles in edge-colored complete graphs
This page was built for publication: Color degree and heterochromatic cycles in edge-colored graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449221)
