Characterizations of graphs having orientations satisfying local degree restrictions

DOI10.21136/cmj.1978.101517zbMath0375.05028OpenAlexW3047771695MaRDI QIDQ4154884

Roger Entringer, L. Kirk Tolman

Publication date: 1978

Full work available at URL: https://eudml.org/doc/13048

Mathematics Subject Classification ID

Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Some Combinatorially Defined Matrix Classes ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ Tournaments associated with multigraphs and a theorem of Hakimi

Cites Work

• On the degrees of the vertices of a directed graph
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• The Comparability Graph of a Tree
• Kasteleyn's Theorem and Arbitrary Graphs
• Transitiv orientierbare Graphen
• Which Graphs have only Self-Converse Orientations?
• Undirected Graphs Realizable as Graphs of Modular Lattices
• A Note on Orientation of Graphs
• A Note on Undirected Graphs Realizable as P.O. Sets
• A Characterization of Comparability Graphs and of Interval Graphs
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizations of graphs having orientations satisfying local degree restrictions