Characterizations of graphs having orientations satisfying local degree restrictions

DOI10.21136/CMJ.1978.101517zbMATH Open0375.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

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

Cited In (5)

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

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)