Some remarks on long monochromatic cycles in edge-colored complete graphs

DOI10.1016/J.DISC.2011.01.016zbMATH Open1222.05056OpenAlexW2066316519MaRDI QIDQ533775FDOQ533775

Authors: Shinya Fujita 

Publication date: 6 May 2011

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

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

Recommendations

• scientific article; zbMATH DE number 6470879
• Long properly colored cycles in edge colored complete graphs
• Monochromatic cycles in 2-coloured graphs
• Vertex coverings by monochromatic cycles and trees
• Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs

zbMATH Keywords

circumferencemonochromatic cyclesedge-colored complete graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• On maximal paths and circuits of graphs
• On the circumference of a graph and its complement

Cited In (8)

• Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree
• The Monochromatic Circumference of 2‐Edge‐Colored Graphs
• Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
• Title not available (Why is that?)
• Periods in missing lengths of rainbow cycles
• Cycles avoiding a color in colorful graphs
• Revisit of Erdős-Gallai's theorem on the circumference of a graph
• Monochromatic even cycles

This page was built for publication: Some remarks on long monochromatic cycles in edge-colored complete graphs

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