Uniformly 3‐connected graphs

DOI10.1002/jgt.23049OpenAlexW4387696354MaRDI QIDQ6144917

Li Qiong Xu

Publication date: 30 January 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.23049

zbMATH Keywords

independent pathsgraph constructionsuniform 3-connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A constructive characterization of 3-connected triangle-free graphs
• Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
• Minimally k-connected graphs of low order and maximal size
• Minimally 3-connected graphs
• A classification of 4-connected graphs
• The average connectivity of a graph
• On minimally \((n,\lambda)\)-connected graphs
• Removable edges in a 5-connected graph and a construction method of 5-connected graphs
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• Edge-connectivity matrices and their spectra
• Multi-Terminal Network Flows
• Minimally 2-connected graphs.
• On Minimal Blocks
• Uniformly connected graphs

This page was built for publication: Uniformly 3‐connected graphs