Pancyclism and bipancyclism of Hamiltonian graphs

DOI10.1006/JCTB.1994.1010zbMATH Open0795.05086OpenAlexW2026854216MaRDI QIDQ1322012FDOQ1322012

Shemin Zhang

Publication date: 6 June 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1010

zbMATH Keywords

bipartite graphboundsHamiltonian graphpancyclic graphbipancyclic bipartite graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cited In (12)

• Pancyclic BIBD block-intersection graphs
• Locally pancyclic graphs
• A condition for a Hamiltonian bipartite graph to be bipancyclic
• Title not available (Why is that?)
• Edge condition for a Hamiltonian bipartite graph to be bipancyclic
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Ramsey numbers for stars of even order versus a wheel of order nine
• A new Chvátal type condition for pancyclicity
• Pancyclicity of OTIS (swapped) networks based on properties of the factor graph
• Pancyclicity when each cycle must pass exactly \(k\) Hamilton cycle chords
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• A condition for a Hamiltonian bipartite graph to be bipancyclic 👍 👎
• Title not available (Why is that?) 👍 👎
• Locally pancyclic graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Longest cycles in certain bipartite graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• A cycle structure theorem for Hamiltonian graphs 👍 👎

This page was built for publication: Pancyclism and bipancyclism of Hamiltonian graphs

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