scientific article

zbMATH Open0696.05054MaRDI QIDQ3472144

Author name not available (Why is that?)

Publication date: 1988

Title of this publication is not available (Why is that?)

zbMATH Keywords

1-factork-regular bipartite graphk-spread

Mathematics Subject Classification ID

Graph theory (05C99) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Being Hamiltonian is not a Tutte invariant

Recommendations

• Title not available (Why is that?) 👍 👎
• Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian 👍 👎
• Every simple 3-polytype with 34 vertices is Hamiltonian 👍 👎
• Being Hamiltonian is not a Tutte invariant 👍 👎
• A Hamiltonian characterization of the three-ball 👍 👎
• Not every 2-tough graph is Hamiltonian 👍 👎
• On 3-step Hamiltonian trees 👍 👎
• Hamilton cycles in 3-out 👍 👎
• Hamiltonian tournaments with the least number of 3-cycles 👍 👎
• Hamiltonian Chordal Graphs are not Cycle Extendable 👍 👎

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