Paths and circuits in partially directed graphs (Q1296988): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q1811077 |
||
Property / reviewed by | |||
Property / reviewed by: Norman F.Quimpo / rank | |||
Revision as of 22:12, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Paths and circuits in partially directed graphs |
scientific article |
Statements
Paths and circuits in partially directed graphs (English)
0 references
2 January 2000
0 references
The authors examine the validity of known results on Eulerian circuits and edge coverings if the graphs are taken to have both directed and undirected edges. Necessary and sufficient conditions are given (1) for an Eulerian path to exist in such a graph when there are two odd vertices; (2) for the edges of such a graph to be covered by no more than \(n\) edge disjoint paths, or for the graph to be Eulerian, in the case where every vertex of \(G\) is even.
0 references
Eulerian circuit
0 references
Eulerian path
0 references
partially directed graph
0 references