Non-zero disjoint cycles in highly connected group labeled graphs

DOI10.1016/j.endm.2005.06.053zbMath1200.05120OpenAlexW2068738736MaRDI QIDQ3439347

Ken-ichi Kawarabayashi, Paul Wollan

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.053

zbMATH Keywords

odd cyclesErdős-Pósagroup labeled graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)

Related Items (1)

Non-zero disjoint cycles in highly connected group labeled graphs

Cites Work

• Unnamed Item
• The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces
• Packing non-zero \(A\)-paths in group-labelled graphs
• Highly parity linked graphs
• Mangoes and blueberries
• Non-zero disjoint cycles in highly connected group labeled graphs
• On the presence of disjoint subgraphs of a specified type
• The Erdős-Pósa property for odd cycles in highly connected graphs
• The Erdős-Pósa property for odd cycles in graphs of large connectivity

This page was built for publication: Non-zero disjoint cycles in highly connected group labeled graphs