Paths and cycles concerning independence edges

DOI10.1007/BF01787702zbMATH Open0723.05075OpenAlexW1991268275MaRDI QIDQ757417FDOQ757417

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

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

zbMATH Keywords

admissible pathTutte's 1-factor theoremadmissible cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• The Two-Triangle Case of the Acquaintance Graph
• The Factorization of Linear Graphs
• Applications of Menger's graph theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Factors of Graphs
• Circuits through specified edges
• On factorisation of graphs
• Any four independent edges of a 4-connected graph are contained in a circuit
• Circuits containing specified edges

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)