On Hamiltonian bipartite graphs
From MaRDI portal
Publication:2626464
DOI10.1007/BF02759704zbMath0119.38806WikidataQ56209815 ScholiaQ56209815MaRDI QIDQ2626464
Publication date: 1963
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
05C45: Eulerian and Hamiltonian graphs
Related Items
Degree sum conditions for cyclability in bipartite graphs, Balanced degree-magic complements of bipartite graphs, Spanning \(k\)-ended trees of bipartite graphs, Long cycles in unbalanced bipartite graphs, 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, Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs, Recent advances on the Hamiltonian problem: survey III, Toughness in graphs -- a survey, On Hamilton's ideals, Note on Hamilton circuits and Hamilton paths, Spanning Cycles Through Specified Edges in Bipartite Graphs
Cites Work
