Characterizations of graphs having orientations satisfying local degree restrictions

DOI10.21136/CMJ.1978.101517zbMATH0375.05028OpenAlexW3047771695MaRDI QIDQ4154884FDOQ4154884

Authors R. C. Entringer, L. Kirk Tolman

Publication date 1978

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3172312 (Why is no real title available?)
• scientific article; zbMATH DE number 3220182 (Why is no real title available?)
• scientific article; zbMATH DE number 3224338 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• scientific article; zbMATH DE number 3312524 (Why is no real title available?)
• scientific article; zbMATH DE number 3326387 (Why is no real title available?)
• scientific article; zbMATH DE number 3334027 (Why is no real title available?)
• scientific article; zbMATH DE number 3349865 (Why is no real title available?)
• scientific article; zbMATH DE number 3407703 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A Characterization of Comparability Graphs and of Interval Graphs
• A Note on Orientation of Graphs
• A Note on Undirected Graphs Realizable as P.O. Sets
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Kasteleyn's Theorem and Arbitrary Graphs
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• On the degrees of the vertices of a directed graph
• The Comparability Graph of a Tree
• Transitiv orientierbare Graphen
• Undirected Graphs Realizable as Graphs of Modular Lattices
• Which Graphs have only Self-Converse Orientations?

Cited in

(5)

• Tournaments associated with multigraphs and a theorem of Hakimi
• Brooks-type theorems for relaxations of square colorings
• On an \(f\)-coloring generalization of linear arboricity of multigraphs
• Some Combinatorially Defined Matrix Classes
• Orientation‐based edge‐colorings and linear arboricity of multigraphs

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

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