Packing circuits in eulerian digraphs (Q1924492): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On two minimax theorems in graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Minimax Theorem for Directed Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sachs' linkless embedding conjecture / rank | |||
Normal rank |
Latest revision as of 15:18, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Packing circuits in eulerian digraphs |
scientific article |
Statements
Packing circuits in eulerian digraphs (English)
0 references
24 November 1996
0 references
A digraph is eulerian if for every vertex \(v\) its invalency equals its outvalency. Let \(G\) be a eulerian digraph. If \(H\) can be obtained from a subgraph of \(G\) by contracting edges then \(H\) is a minor of \(G\). Suppose \(c\) is the maximum number of pairwise edge-disjoint directed circuits of \(G\) and \(t\) the smallest size set of edges that meets all directed circuits of \(G\). The author shows that if \(G\) is a eulerian digraph such that the underlying undirected graph has no minor in the Peterson family then \(c=t\).
0 references
digraph
0 references
minor
0 references
directed circuits
0 references