Graphs and digraphs with given girth and connectivity

DOI10.1016/0012-365X(92)00576-DzbMath0805.05048OpenAlexW2044466924MaRDI QIDQ1336679

Hui Shan Zhou, Ji Ping Liu

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

digraphconnectivitygirth

Mathematics Subject Classification ID

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

Related Items (4)

Rainbow and monochromatic circuits and cocircuits in binary matroids ⋮ Forbidden subgraphs generating a finite set ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Regular graphs with given girth pair
• On partitioning the edges of graphs into connected subgraphs

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