Graphs and digraphs with given girth and connectivity

DOI10.1016/0012-365X(92)00576-DMaRDI QIDQ1336679zbMATH OpenOpenAlexFDO

Authors Jiping Liu, Huishan Zhou

Publication date 3 November 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(92)00576-d

zbMATH Keywords

connectivitydigraphgirth

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 2188339
• K-linked graphs with girth condition
• Connectivity of graphs with given girth pair
• On the girth of digraphs
• Contractible cycles in graphs with girth at least 5

Cites work

• scientific article; zbMATH DE number 3236772 (Why is no real title available?)
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Graph theory
• On partitioning the edges of graphs into connected subgraphs
• Regular graphs with given girth pair

Cited in

(8)

• scientific article; zbMATH DE number 2188339 (Why is no real title available?)
• Connectivity of graphs with given girth pair
• Rainbow and monochromatic circuits and cocircuits in binary matroids
• A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
• Tree in forbidden triples generating a finite set of graphs with high connectivity
• PROPERTY A AND GRAPHS WITH LARGE GIRTH
• Forbidden subgraphs generating a finite set
• scientific article; zbMATH DE number 908762 (Why is no real title available?)

This page was built for publication: Graphs and digraphs with given girth and connectivity

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