On the degrees of the vertices of a directed graph
From MaRDI portal
Publication:2532282
DOI10.1016/0016-0032(65)90340-6zbMath0173.26404OpenAlexW2098621549MaRDI QIDQ2532282
Publication date: 1965
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(65)90340-6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Studies on directed graphs. I, II
- A theorem on flows in networks
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
- Partitions and Their Representative Graphs
Related Items (only showing first 100 items - show all)
Distributed domination on sparse graph classes ⋮ A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences ⋮ Tree densities in sparse graph classes ⋮ Modulo orientations and matchings in graphs ⋮ Extended formulations for sparsity matroids ⋮ Coloring, sparseness and girth ⋮ The reversing number of a digraph ⋮ Algorithms for finding a rooted \((k,1)\)-edge-connected orientation ⋮ Some Combinatorially Defined Matrix Classes ⋮ Determining the circular flow number of a cubic graph ⋮ Modulo orientations with bounded independence number ⋮ On coloring numbers of graph powers ⋮ On orientations and shortest paths ⋮ Universal targets for homomorphisms of edge-colored graphs ⋮ Nowhere-zero 3-flow of graphs with small independence number ⋮ Proper 3-orientations of bipartite planar graphs with minimum degree at least 3 ⋮ Proper orientations of planar bipartite 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 ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ The number of 3-SAT functions ⋮ Coloring games on squares of graphs ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition ⋮ Generalized cuckoo hashing with a stash, revisited ⋮ On the orientation of graphs ⋮ The spectral radius, maximum average degree and cycles of consecutive lengths of graphs ⋮ A decomposition method on solving the linear arboricity conjecture ⋮ A note on degree-constrained subgraphs ⋮ Contractible graphs for flow index less than three ⋮ Mod $(2p+1)$-Orientation on Bipartite Graphs and Complementary Graphs ⋮ Directed domination in oriented graphs ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ Characterizations of graphs having orientations satisfying local degree restrictions ⋮ On the rank of general linear series on stable curves ⋮ Homomorphisms to small negative even cycles ⋮ The pseudoforest analogue for the strong nine dragon tree conjecture is true ⋮ Orientability Thresholds for Random Hypergraphs ⋮ A connection between sports and matroids: how many teams can we beat? ⋮ Combined connectivity augmentation and orientation problems ⋮ Bin Packing with Colocations ⋮ Relation between the correspondence chromatic number and the Alon-Tarsi number ⋮ Monochromatic subgraphs in iterated triangulations ⋮ Lattices, graphs, and Conway mutation ⋮ Degrees in oriented hypergraphs and sparse Ramsey theory ⋮ Tree-compositions and orientations ⋮ Tournaments associated with multigraphs and a theorem of Hakimi ⋮ Combinatorics of compactified universal Jacobians ⋮ Modular Orientations of Random and Quasi-Random Regular Graphs ⋮ Distance between \(\alpha\)-orientations of plane graphs by facial cycle reversals ⋮ A note on strong edge coloring of sparse graphs ⋮ The minimum feasible tileset problem ⋮ Orientations of graphs with prescribed weighted out-degrees ⋮ Decomposing a graph into pseudoforests with one having bounded degree ⋮ The robust chromatic number of graphs ⋮ Riemann-Roch theory for graph orientations ⋮ Decomposing a graph into forests and a matching ⋮ Infinitely connected subgraphs in graphs of uncountable chromatic number ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ Bruhat order of tournaments ⋮ Embedding Partial k‐Star Designs ⋮ The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges ⋮ A rooted-forest partition with uniform vertex demand ⋮ On the Swap-Distances of Different Realizations of a Graphical Degree Sequence ⋮ New linearizations of quadratic assignment problems ⋮ On the realization of a (p,s)-digraph with prescribed degrees ⋮ Relations between graphs and integer-pair sequences ⋮ Uniform Sampling of Digraphs with a Fixed Degree Sequence ⋮ Decomposing a graph into forests: the nine dragon tree conjecture is true ⋮ A Golden Ratio Inequality for Vertex Degrees of Graphs ⋮ Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity ⋮ The edge-orientation problem and some of its variants on weighted graphs ⋮ Weighted, bipartite, or directed stream graphs for the modeling of temporal networks ⋮ Nonparametric Variable Selection, Clustering and Prediction for Large Biological Datasets ⋮ Degree-constrained orientations of embedded graphs ⋮ An upper bound on adaptable choosability of graphs ⋮ On mod \((2p+1)\)-orientations of graphs ⋮ Tripartite graphs with given degree set ⋮ On the packing/covering conjecture of infinite matroids ⋮ Smaller universal targets for homomorphisms of edge-colored graphs ⋮ Assur decompositions of direction-length frameworks ⋮ Upper and lower degree-constrained graph orientation with minimum penalty ⋮ Rooted \(k\)-connections in digraphs ⋮ Decomposing a graph into forests ⋮ Packing of Steiner trees and \(S\)-connectors in graphs ⋮ Strong Chromatic Index of Sparse Graphs ⋮ Balanced Valuations and Flows in Multigraphs ⋮ CANONICAL REPRESENTATIVES FOR DIVISOR CLASSES ON TROPICAL CURVES AND THE MATRIX–TREE THEOREM ⋮ Planar Ramsey graphs ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ Adaptable chromatic number of graph products ⋮ Balls, bins, and embeddings of partial \(k\)-star designs ⋮ Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences ⋮ Decreasing minimization on M-convex sets: algorithms and applications ⋮ Locating-dominating sets: from graphs to oriented graphs ⋮ Decomposition into two trees with orientation constraints ⋮ Local planar domination revisited ⋮ The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
This page was built for publication: On the degrees of the vertices of a directed graph
