Bipartite graphs with cycles of all even lengths

DOI10.1002/JGT.3190060407MaRDI QIDQ3967560zbMATH OpenOpenAlexFDO

Authors E. Schmeichel, John Mitchem

Publication date 1982

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190060407

zbMATH Keywords

bipartite graphvertex degreescycles of even length

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited in

(17)

• Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
• New sufficient conditions for bipancyclic bipartite graphs
• A condition for a Hamiltonian bipartite graph to be bipancyclic
• Cycles and paths of many lengths in bipartite digraphs
• Transversals and bipancyclicity in bipartite graph families
• Extending cycles in bipartite graphs
• On size multipartite Ramsey numbers for stars versus paths and cycles
• Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity
• On degree conditions of semi-balanced 3-partite Hamiltonian graphs
• Graphs and degree sequences. I
• Cycle spectra of Hamiltonian graphs
• Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs
• On Ore-type sufficient condition for a bipancyclic ordering
• On cycle lengths in graphs of moderate degree
• Uniquely Bipancyclic Graphs on Thirty-two Vertices
• Vertex-bipancyclicity in a bipartite graph collection
• Tight cycles and regular slices in dense hypergraphs

This page was built for publication: Bipartite graphs with cycles of all even lengths

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