Vertices of degree k in a minimally k-edge-connected digraph

DOI10.1016/S0012-365X(99)00362-3zbMATH Open0953.05028MaRDI QIDQ1978168FDOQ1978168

Authors Xudong Yuan, Mao-Cheng Cai 

Publication date 24 July 2000

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

digraph\(k\)-edge-connectedindegreeoutdegreeterminal\(k\)-cutcrossing-free

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Recommendations

• Publication:4946545
• The number of vertices of degree \(k\) in a minimally \(k\)-edge connected graph
• A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph

Cited In (14)

• Title not available (Why is no real title available?)
• Tight bounds for the vertices of degree k in minimally k‐connected graphs
• Counting strongly connected \((k_1,k_2)\)-directed cores
• On Vertices of outdegree n in minimally n‐connected digraphs
• Title not available (Why is no real title available?)
• Lower bounds on the vertex-connectivity of oriented graphs and bipartite oriented graphs
• Minimally \(k\)-edge-connected directed graphs of maximal size
• Existence of vertices of local connectivity \(k\) in digraphs of large outdegree
• Ends and vertices of small degree in infinite minimally \(k\)-(Edge)-connected graphs
• On vertices of outdegree \(k\) in minimally \(k\)-arc-connected digraphs
• The constructive characterization of \((k,l)\)-edge-connected digraphs
• The vertex connectivity of a \(\{ 0,2\}\)-graph equals its degree
• A remark on the number of vertices of degree \(k\) in a minimally \(k\)-edge- connected graph
• On extremal \(k\)-outconnected graphs

This page was built for publication: Vertices of degree \(k\) in a minimally \(k\)-edge-connected digraph

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