Union of neighborhoods for the length of paths and cycles in balanced bipartite graphs

MaRDI QIDQ2869019zbMATH OpenFDO

Authors Daniel Brito, Pedro Mago, Felicia Villarroel

Publication date 30 December 2013

Published in Lecturas Matemáticas (Search for Journal in Brave)

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 935332
• Lower bounds of length of longest cycles in graphs involving neighborhood unions
• Neighborhood unions and cyclability of graphs
• Neighborhood unions and the cycle cover number of a graph
• Neighborhood unions and disjoint chorded cycles in graphs
• Neighborhood union for \([a,b]\)-\(k\)-uniform graphs
• Neighborhood unions for the existence of disjoint chorded cycles in graphs
• scientific article; zbMATH DE number 1782839
• The Hamiltonicity of bipartite graphs involving neighborhood unions
• A neighborhood union condition for pancyclic graphs

Cited in

(1)

• An extremal problem resulting in many paths.

This page was built for publication: Union of neighborhoods for the length of paths and cycles in balanced bipartite graphs

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