On the edge-connectivity of C_4-free graphs

DOI10.22049/cco.2019.26453.1113zbMath1438.05147OpenAlexW2934009543MaRDI QIDQ5242946

Peter Dankelmann

Publication date: 8 November 2019

Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_13856_bcb7a6a4d152a475da2d7bdfa37a581e.pdf

zbMATH Keywords

edge-connectivitymaximally edge-connected graph

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Degree sequence conditions for maximally edge-connected oriented graphs
• Inverse degree and edge-connectivity
• On graphs with equal edge connectivity and minimum degree
• A property of a-fragments of a digraph
• Results on the edge-connectivity of graphs
• Degree sequence conditions for maximally edge-connected graphs depending on the clique number
• On the connectivity of diamond-free graphs
• Edge‐connectivity in p‐partite graphs
• A Graph-Theoretic Approach to a Communications Problem
• On Graphs that do not Contain a Thomsen Graph

This page was built for publication: On the edge-connectivity of C_4-free graphs