On Hamiltonian bipartite graphs

DOI10.1007/BF02759704zbMath0119.38806WikidataQ56209815 ScholiaQ56209815MaRDI QIDQ2626464

John W. Moon, L. Moser

Publication date: 1963

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graph; graph theory; Hamilton cycle

Mathematics Subject Classification ID

05C45: Eulerian and Hamiltonian graphs

Related Items

Characterizing degree-sum maximal nonhamiltonian bipartite graphs, Applying a condition for a Hamiltonian bipartite graph to be bipancyclic, Small cycles and 2-factor passing through any given vertices in graphs, Cycles and paths of many lengths in bipartite digraphs, Hamiltonian cycles in Dirac graphs, Disjoint Hamiltonian cycles in bipartite graphs, Partition of a bipartite Hamiltonian graph into two cycles, Hamiltonian threshold graphs, Extending cycles in bipartite graphs, On Ore-type sufficient condition for a bipancyclic ordering, A condition for a Hamiltonian bipartite graph to be bipancyclic, On 2-factors containing 1-factors in bipartite graphs, On the bipartite independence number of a balanced bipartite graph, Orientations of Hamiltonian cycles in bipartite digraphs, A sufficient condition for all short cycles, Degree sum conditions for Hamiltonicity on \(k\)-partite graphs, A degree sum condition on Hamiltonian cycles in balanced 3-partite graphs, Neighborhood conditions for balanced independent sets in bipartite graphs, Weakly pancyclic graphs, New sufficient conditions for bipancyclic bipartite graphs, Hamiltonicity in balanced \(k\)-partite graphs, Toughness in graphs -- a survey, On Hamilton's ideals, Note on Hamilton circuits and Hamilton paths

Cites Work

• Unnamed Item
• Unnamed Item
• Arc coverings of graphs
• Correction to "Computation of supremal (A,B)-Invariant and controllability subspaces"
• Note on Hamilton Circuits
• On maximal paths and circuits of graphs
• Some Theorems on Abstract Graphs