Graphs and digraphs with given girth and connectivity

DOI10.1016/0012-365X(92)00576-DzbMATH Open0805.05048OpenAlexW2044466924MaRDI QIDQ1336679FDOQ1336679

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

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

zbMATH Keywords

connectivitydigraphgirth

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Title not available (Why is that?)
• On partitioning the edges of graphs into connected subgraphs
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Regular graphs with given girth pair
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte

Cited In (8)

• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)