On extremal bipartite graphs with high girth

DOI10.1016/J.ENDM.2006.08.012zbMATH Open1225.05141OpenAlexW2159154431MaRDI QIDQ3439643FDOQ3439643

Authors: C. Balbuena, P. García-Vázquez, Xavier Marcote, 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

Recommendations

• scientific article; zbMATH DE number 5551576
• Extremal bipartite graphs with given girth
• A Note on Bipartite Graphs Without 2 k -Cycles
• On the girth of extremal graphs without shortest cycles
• Properties of certain families of \(2k\)-cycle-free graphs

zbMATH Keywords

bipartite graphgirthextremal graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Minimal Regular Graphs of Girths Eight and Twelve
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extremal graphs without three‐cycles or four‐cycles
• Title not available (Why is that?)
• On the structure of extremal graphs of high girth
• On the girth of extremal graphs without shortest cycles
• On the distance connectivity of graphs and digraphs

Cited In (10)

• Title not available (Why is that?)
• New bounds on \(\bar{2}\)-separable codes of length 2
• On extremal graphs with bounded girth
• On the bipartite density of regular graphs with large girth
• A Note on Bipartite Graphs Without 2 k -Cycles
• High-girth graphs avoiding a minor are nearly bipartite
• Title not available (Why is that?)
• Extremal bipartite graphs with given girth
• Girths of bipartite sextet graphs
• Codes with the identifiable parent property for multimedia fingerprinting

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

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