On the degrees of the vertices of a directed graph

Cites work

scientific article; zbMATH DE number 3159208 (Why is no real title available?)
scientific article; zbMATH DE number 3167398 (Why is no real title available?)
scientific article; zbMATH DE number 3060538 (Why is no real title available?)
A theorem on flows in networks
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
Partitions and Their Representative Graphs
Studies on directed graphs. I, II

Cited in

(99)

Degree-constrained graph orientation: maximum satisfaction and minimum violation
The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
On the realization of a (p,s)-digraph with prescribed degrees
Riemann-Roch theory for graph orientations
Balls, bins, and embeddings of partial \(k\)-star designs
Embedding partial \(k\)-star designs
Generalized cuckoo hashing with a stash, revisited
Combined connectivity augmentation and orientation problems
Coloring games on squares of graphs
Combinatorics of compactified universal Jacobians
Lattices, graphs, and Conway mutation
A decomposition method on solving the linear arboricity conjecture
New linearizations of quadratic assignment problems
Strong chromatic index of sparse graphs
Distance between \(\alpha\)-orientations of plane graphs by facial cycle reversals
Sufficient conditions for graphicality of bidegree sequences
On mod \((2p+1)\)-orientations of graphs
Proper orientations and proper chromatic number
A note on degree-constrained subgraphs
Decomposition into two trees with orientation constraints
On the orientation of graphs
On orientations maximizing total arc-connectivity
A rooted-forest partition with uniform vertex demand
Determining the circular flow number of a cubic graph
An upper bound on adaptable choosability of graphs
Algorithms for finding a rooted \((k,1)\)-edge-connected orientation
Planar Ramsey graphs
Packing of Steiner trees and \(S\)-connectors in graphs
Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity
Generalization of transitive fraternal augmentations for directed graphs and its applications
On orientations and shortest paths
The reversing number of a digraph
Balanced Valuations and Flows in Multigraphs
Decomposing a graph into forests: the nine dragon tree conjecture is true
Decomposing a graph into forests and a matching
The robust chromatic number of graphs
Characterizations of graphs having orientations satisfying local degree restrictions
On the packing/covering conjecture of infinite matroids
Monochromatic subgraphs in iterated triangulations
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
On coloring numbers of graph powers
Extended formulations for sparsity matroids
Digraph analogues for the Nine Dragon Tree Conjecture
Canonical representatives for divisor classes on tropical curves and the matrix-tree theorem
Tree densities in sparse graph classes
Coloring, sparseness and girth
Bruhat order of tournaments
Degrees in oriented hypergraphs and sparse Ramsey theory
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Adaptable chromatic number of graph products
On an \(f\)-coloring generalization of linear arboricity of multigraphs
Distributed domination on sparse graph classes
Proper orientations of planar bipartite graphs
Bin packing with colocations
On the rank of general linear series on stable curves
Tournaments associated with multigraphs and a theorem of Hakimi
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
Modulo orientations with bounded independence number
Mod \((2p+1)\)-orientation on bipartite graphs and complementary graphs
Rooted \(k\)-connections in digraphs
The number of 3-SAT functions
Contractible graphs for flow index less than three
Smaller universal targets for homomorphisms of edge-colored graphs
Modulo orientations and matchings in graphs
The pseudoforest analogue for the strong nine dragon tree conjecture is true
Homomorphisms to small negative even cycles
The edge-orientation problem and some of its variants on weighted graphs
Directed domination in oriented graphs
A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges
Orientation‐based edge‐colorings and linear arboricity of multigraphs
Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences
Orientations of graphs with prescribed weighted out-degrees
Decomposing a graph into pseudoforests with one having bounded degree
Decomposing a graph into forests
Some Combinatorially Defined Matrix Classes
Modular orientations of random and quasi-random regular graphs
Relations between graphs and integer-pair sequences
Nowhere-zero 3-flow of graphs with small independence number
Nonparametric variable selection, clustering and prediction for large biological datasets
A note on strong edge coloring of sparse graphs
Assur decompositions of direction-length frameworks
Universal targets for homomorphisms of edge-colored graphs
Tripartite graphs with given degree set
Uniform sampling of digraphs with a fixed degree sequence
A Golden Ratio Inequality for Vertex Degrees of Graphs
A connection between sports and matroids: how many teams can we beat?
Orientability Thresholds for Random Hypergraphs
Locating-dominating sets: from graphs to oriented graphs
Relation between the correspondence chromatic number and the Alon-Tarsi number
On the swap-distances of different realizations of a graphical degree sequence
Weighted, bipartite, or directed stream graphs for the modeling of temporal networks
Upper and lower degree-constrained graph orientation with minimum penalty
The spectral radius, maximum average degree and cycles of consecutive lengths of graphs
Tree-compositions and orientations
Local planar domination revisited
Infinitely connected subgraphs in graphs of uncountable chromatic number
Degree-constrained orientations of embedded graphs
Decreasing minimization on M-convex sets: algorithms and applications

This page was built for publication: On the degrees of the vertices of a directed graph

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