Paths and cycles concerning independence edges

DOI10.1007/BF01787702zbMath0723.05075OpenAlexW1991268275MaRDI QIDQ757417

Atsushi Kaneko

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1007/bf01787702

zbMATH Keywords

admissible pathTutte's 1-factor theoremadmissible cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Any four independent edges of a 4-connected graph are contained in a circuit
• Circuits through specified edges
• Circuits containing specified edges
• Applications of Menger's graph theorem
• The Two-Triangle Case of the Acquaintance Graph
• The Factorization of Linear Graphs
• On factorisation of graphs
• The Factors of Graphs

This page was built for publication: Paths and cycles concerning independence edges