Paths and circuits in partially directed graphs

DOI10.1016/S0012-365X(98)00185-XMaRDI QIDQ1296988zbMATH OpenFDO

Authors D. W. Barnette, Shelley Gillett

Publication date 2 January 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(98)00185-X

zbMATH Keywords

Eulerian circuitEulerian pathpartially directed graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Review text

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.

Recommendations

• Covering partially directed graphs with directed paths
• Publication:5753982
• Covers of Eulerian graphs
• scientific article; zbMATH DE number 4103110

Cited in

(11)

• Eulerian graphs and related topics. Part 1, Volume 2
• Covering partially directed graphs with directed paths
• Even and odd Eulerian paths.
• The paths with local restrictions
• Paths, chains, and antipaths
• scientific article; zbMATH DE number 4150213 (Why is no real title available?)
• scientific article; zbMATH DE number 4077268 (Why is no real title available?)
• scientific article; zbMATH DE number 4103110 (Why is no real title available?)
• scientific article; zbMATH DE number 4183442 (Why is no real title available?)
• scientific article; zbMATH DE number 4189770 (Why is no real title available?)
• Paths and circuits in g-graphs

This page was built for publication: Paths and circuits in partially directed graphs

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