On extremal bipartite graphs with high girth

DOI10.1016/j.endm.2006.08.012zbMath1225.05141OpenAlexW2159154431MaRDI QIDQ3439643

Camino Balbuena, Xavier Marcote, Pedro García-Vázquez, J. Carlos Valenzuela-Tripodoro

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.08.012

zbMATH Keywords

bipartite graphgirthextremal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (2)

New bounds on \(\bar{2}\)-separable codes of length 2 ⋮ Codes with the identifiable parent property for multimedia fingerprinting

Cites Work

• On the girth of extremal graphs without shortest cycles
• On the distance connectivity of graphs and digraphs
• Extremal graphs without three‐cycles or four‐cycles
• On the structure of extremal graphs of high girth
• Minimal Regular Graphs of Girths Eight and Twelve
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On extremal bipartite graphs with high girth