On the realization of a (p,s)-digraph with prescribed degrees

DOI10.1016/0016-0032(66)90301-2zbMath0304.05111OpenAlexW1967454948MaRDI QIDQ1216320

Wai-Kai Chen

Publication date: 1966

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(66)90301-2

Mathematics Subject Classification ID

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

Related Items (13)

Leaf realization problem, caterpillar graphs and prefix normal words ⋮ A note on the characterization of digraphic sequences ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ Subgraphs and their degree sequences of a digraph ⋮ Efficiently Realizing Interval Sequences ⋮ A parameterized algorithmics framework for degree sequence completion problems in directed graphs ⋮ Uniform Sampling of Digraphs with a Fixed Degree Sequence ⋮ NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs ⋮ Dag Realizations of Directed Degree Sequences ⋮ On d-invariant transformations of (\(p,s\))-digraphs ⋮ Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences ⋮ Relaxed and approximate graph realizations

Cites Work

• A theorem on flows in networks
• Zero-one matrices with zero trace
• On the degrees of the vertices of a directed graph
• Über eine spezielle Klasse Eulerscher Graphen
• Combinatorial Properties of Matrices of Zeros and Ones
• Graphs and Subgraphs, II
• 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

This page was built for publication: On the realization of a (p,s)-digraph with prescribed degrees