On Hamiltonian bipartite graphs
From MaRDI portal
Publication:2626464
Cites work
- Arc coverings of graphs
- Correction to "Computation of supremal (A,B)-Invariant and controllability subspaces"
- scientific article; zbMATH DE number 3186565 (Why is no real title available?)
- scientific article; zbMATH DE number 3186566 (Why is no real title available?)
- Note on Hamilton Circuits
- On maximal paths and circuits of graphs
- Some Theorems on Abstract Graphs
Cited in
(only showing first 100 items - show all)- 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
- Hamiltonian properties and the bipartite independence number
- 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
- Extremal problems on the Hamiltonicity of claw-free graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
- Chorded pancyclicity in \(k\)-partite graphs
- New sufficient conditions for bipancyclicity of balanced bipartite digraphs
- New sufficient conditions for bipancyclic bipartite graphs
- Hamiltonicity in balanced \(k\)-partite graphs
- On Hamiltonian cycles in balanced \(k\)-partite graphs
- A localization method in Hamiltonian graph theory
- Star edge-coloring of graphs with maximum degree four
- A variation of the Erdős-Sós conjecture in bipartite graphs
- Spanning bipartite graphs with large degree sum in graphs of odd order
- Finding long cycles in balanced tripartite graphs: a first step
- Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
- Distance spectrum, 1-factor and vertex-disjoint cycles
- On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs
- A note on minimum degree condition for Hamilton (a,b)-cycles in hypergraphs
- From one to many rainbow Hamiltonian cycles
- Notes on Hamiltonian threshold and chain graphs
- Extremal problems on distance spectra of graphs
- On 2-factor Hamiltonian regular bipartite graphs
- Spanning bipartite graphs with high degree sum in graphs
- A degree sum condition for the existence of an S-path-system in a bipartite graph
- Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
- Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
- A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
- Partial degree conditions and cycle coverings in bipartite graphs
- Recent advances on the Hamiltonian problem: survey III
- Toughness in graphs -- a survey
- On Hamilton's ideals
- Note on Hamilton circuits and Hamilton paths
- On the Hamiltonicity of random bipartite graphs
- Bipartite independent number and Hamilton-biconnectedness of bipartite graphs
- Hamiltonicity in prime sum graphs
- Some local-global phenomena in locally finite graphs
- Transversals and bipancyclicity in bipartite graph families
- Hamiltonian and long paths in bipartite graphs with connectivity
- Degree sequence conditions for a graph to be disjoint path coverable
- Panconnectivity in bipartite graphs with large degree sum
- Betwixt and between 2-factor Hamiltonian and perfect-matching-Hamiltonian graphs
- Graph avoidance in Hamilton laceable bipartite graphs
- Spanning cycles through specified edges in bipartite graphs
- Arbitrary orientations of Hamilton cycles in digraphs
- Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
- Hamiltonicity in Split Graphs - A Dichotomy
- Tight cycles in hypergraphs
- Degree sum conditions for cyclability in bipartite graphs
- Balanced degree-magic complements of bipartite graphs
- Spanning \(k\)-ended trees of bipartite graphs
- scientific article; zbMATH DE number 1289752 (Why is no real title available?)
- Long cycles in unbalanced bipartite graphs
- scientific article; zbMATH DE number 1990709 (Why is no real title available?)
- Distance signless Laplacian spectral radius and Hamiltonian properties of graphs
- scientific article; zbMATH DE number 6949373 (Why is no real title available?)
- Spanning \(k\)-trees of bipartite graphs
- scientific article; zbMATH DE number 7366808 (Why is no real title available?)
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
- Uniquely Bipancyclic Graphs on Thirty-two Vertices
- Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs
- Some generalizations of spectral conditions for \(2s\)-Hamiltonicity and \(2s\)-traceability of bipartite graphs
- A rainbow Dirac's theorem
- Tight cycles and regular slices in dense hypergraphs
- On degree conditions of semi-balanced 3-partite Hamiltonian graphs
- The largest eigenvalue conditions for Hamiltonian and traceable graphs
- Bipartite Kneser graphs are Hamiltonian
- Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
- On sufficient conditions for spanning structures in dense graphs
- Exact bipartite Turán numbers of large even cycles
- Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian
- A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
- Bipartite Ramsey numbers of cycles
- Vertex-bipancyclicity in a bipartite graph collection
- Characterizing degree-sum maximal nonhamiltonian bipartite graphs
- Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\)
- Transversal Hamilton cycle in hypergraph systems
- Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
- Degree conditions of two vertices with distance two or three for the existence of a Hamilton cycle passing through a matching in a bipartite graph
- Degree conditions for disjoint path covers in graphs
- Alternating paths in oriented graphs with large semidegree
- Transversal panconnectedness in graph collections
- On partitioning a bipartite graph into cycles and degenerated cycles
- Degree condition on distance three for Hamiltonian-biconnected in balanced bipartite graphs
- On degree conditions of semi-balanced k-partite Hamiltonian graphs
- The general inverse degree and some Hamiltonian properties of graphs
This page was built for publication: On Hamiltonian bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2626464)