The number of arcs of a strongly connected oriented graph with two noncritical vertices

zbMATH Open1249.05168MaRDI QIDQ2887148FDOQ2887148

Authors: Shangwei Lin, Chunfang Li, Shiying Wang 

Publication date: 1 June 2012

Published in: Operations Research Transactions (Search for Journal in Brave)

Recommendations

• \(n\)-arc connected graphs
• On the number of noncritical vertices in strongly connected digraphs
• scientific article; zbMATH DE number 3865311
• The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings
• Strongly 2-connected orientations of graphs
• A note on the Hadwiger number of circular arc graphs
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• The number of edges in critical strongly connected graphs
• On \(d\)-arc-dominated oriented graphs
• On the number of labeled \(k\)-arch graphs

zbMATH Keywords

digraphcritical vertexstrongly connected subdigraph

Mathematics Subject Classification ID

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

Cited In (4)

• On the number of nonseparating vertices in strongly connected local tournaments
• Title not available (Why is that?)
• The number of edges in critical strongly connected graphs
• Title not available (Why is that?)

This page was built for publication: The number of arcs of a strongly connected oriented graph with two noncritical vertices

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