On the degrees of the vertices of a directed graph

Cites work

A theorem on flows in networks
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?)
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

(only showing first 100 items - show all)

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

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)