The heterochromatic cycles in edge-colored graphs
DOI10.1007/S12190-008-0164-YzbMATH Open1172.05321OpenAlexW2092413148MaRDI QIDQ1032004FDOQ1032004
Shuo Li, Guizhen Liu, Dongxiao Yu
Publication date: 23 October 2009
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-008-0164-y
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cites Work
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Multicoloured Hamilton cycles
- Title not available (Why is that?)
- Color degree and heterochromatic cycles in edge-colored graphs
- Polychromatic Hamilton cycles
- Title not available (Why is that?)
- Color degree and heterochromatic matchings in edge-colored bipartite graphs
Cited In (8)
- Title not available (Why is that?)
- Color degree and heterochromatic cycles in edge-colored graphs
- Heterochromatic matchings in edge-colored graphs
- Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs
- Edge-colored complete graphs with alternating cycles
- Color degree and alternating cycles in edge-colored graphs
- A linear heterochromatic number of graphs
- The heterochromatic girth in edge-colored graphs
This page was built for publication: The 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 Q1032004)
