Paths and cycles concerning independence edges

DOI10.1007/BF01787702MaRDI QIDQ757417zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• M-alternating Hamilton paths and M-alternating Hamilton cycles
• scientific article; zbMATH DE number 411176
• Cycles through five edges in 3-connected cubic graphs
• Cycles through four edges in 3-connected cubic graphs
• scientific article; zbMATH DE number 19207

Cites work

• scientific article; zbMATH DE number 3882430 (Why is no real title available?)
• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 2123255 (Why is no real title available?)
• Any four independent edges of a 4-connected graph are contained in a circuit
• Applications of Menger's graph theorem
• Circuits containing specified edges
• Circuits through specified edges
• On factorisation of graphs
• The Factorization of Linear Graphs
• The Factors of Graphs
• The Two-Triangle Case of the Acquaintance Graph

Cited in

(3)

• Atom probe tomography characterization of solute segregation to dislocations and interfaces
• Toggling independent sets of a path graph
• An extension of a theorem on cycles containing specified independent edges

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

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