Edge-colored complete graphs with alternating cycles

DOI10.1016/0012-365X(83)90124-3MaRDI QIDQ788736zbMATH OpenOpenAlexFDO

Authors Sue Whitesides

Publication date 1983

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(83)90124-3

zbMATH Keywords

alternating cyclesmaximum color degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Alternating cycles in edge-colored graphs
• scientific article; zbMATH DE number 718675
• A note on alternating cycles in edge-coloured graphs
• Color degree and alternating cycles in edge-colored graphs
• Long Alternating Cycles in Edge-Colored Complete Graphs
• Alternating paths in edge-colored complete graphs
• Edge-colored complete graphs containing no properly colored odd cycles
• Edge‐colored complete graphs without properly colored even cycles: A full characterization
• The heterochromatic cycles in edge-colored graphs
• Properly colored cycles of different lengths in edge-colored complete graphs

Cites work

• scientific article; zbMATH DE number 3536122 (Why is no real title available?)
• A property of the colored complete graph
• Alternating Hamiltonian cycles
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Graphs with cycles having adjacent lines different colors

Cited in

(4)

• Alternating Hamiltonian cycles
• Color degree and heterochromatic cycles in edge-colored graphs
• Complete edge-colored permutation graphs
• Long Alternating Cycles in Edge-Colored Complete Graphs

This page was built for publication: Edge-colored complete graphs with alternating cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q788736)