scientific article; zbMATH DE number 867680

MaRDI QIDQ4873792zbMATH OpenFDO

Authors Curtiss Barefoot, Jack Douthett, R. C. Entringer, Michael R. Fellows, Lane Clark

Publication date 21 April 1996

zbMATH Keywords

boundcubic graphscyclesubdivisions

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Cycle lengths modulo \(k\) in large 3-connected cubic graphs
• Graphs with a cycle of length divisible by three
• Cycles of length 0 modulo 4 in graphs

Cited in

(14)

• Cycles of length 2 modulo 3 in graphs
• Cycles of length 0 modulo 4 in graphs
• Computer based proofs by induction in graph theory - A house of cards?
• Graphs with a cycle of length divisible by three
• Modification of CZ₃-free condition to have a cycle containing specified vertices
• On the size of graphs whose cycles have length divisible by a fixed integer
• On path lengths modulo three
• Collaborating with Hans: Some Remaining Wonderments
• Cycle lengths modulo \(k\) in large 3-connected cubic graphs
• HOW MANY n-CYCLES DOES PERIOD 3 IMPLY? AN ELEMENTARY APPROACH
• scientific article; zbMATH DE number 2230314 (Why is no real title available?)
• Cycles of length 1 modulo 3 in graph
• On graphs without cycles of length 0 modulo 4
• On the divisibility of the cycle number by 7

This page was built for publication:

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