Pages that link to "Item:Q2149881"

The following pages link to The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings (Q2149881):

Displaying 2 items.

• The number of arcs of a strongly connected oriented graph with two noncritical vertices (Q2887148) (← links)
• Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree (Q3418196) (← links)