On edge-colored graphs covered by properly colored cycles

DOI10.1007/s00373-005-0613-4zbMath1075.05032OpenAlexW2069232834MaRDI QIDQ2573800

Herbert Fleischner, Stefan Szeider

Publication date: 24 November 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-005-0613-4

zbMATH Keywords

CharacterizationCycle covers1-Extendable graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Matching theory
• Alternating cycles in edge-partitioned graphs
• On defect-d matchings in graphs
• A note on alternating cycles in edge-coloured graphs
• Finding paths in graphs avoiding forbidden transitions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On edge-colored graphs covered by properly colored cycles