Balanced graphs and noncovering graphs

DOI10.1016/0012-365X(91)90015-TzbMath0764.05095OpenAlexW1997570254MaRDI QIDQ1176731

Dale Youngs, Oliver Pretzel

Publication date: 25 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90015-t

zbMATH Keywords

balanced graphsdiagram orientationnoncovering graphtriangle-free noncovering graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Related Items (5)

The number of dependent arcs in an acyclic orientation ⋮ Gallai's problem on Dirac's construction ⋮ Independent arcs of acyclic orientations of complete \(r\)-partite graphs ⋮ On an interpolation property of outerplanar graphs ⋮ On the complexity of diagram testing

Cites Work

• Unnamed Item
• Unnamed Item
• Random graphs and covering graphs of posets
• On graphs that can be oriented as diagrams of ordered sets
• On a Probabilistic Graph-Theoretical Method

This page was built for publication: Balanced graphs and noncovering graphs