A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences

DOI10.1142/S1793830923500568MaRDI QIDQ6637059zbMATH OpenFDO

Authors Asish Mukhopadhyay, Daniel John

Publication date 13 November 2024

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830923500568

zbMATH Keywords

digraphic sequencesErdős-Gallai inequalitiesgraphic sequencesRyser-Fulkerson inequalities

Mathematics Subject Classification ID

Vertex degrees (05C07) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A note on the characterization of digraphic sequences
• Graphs with given valences
• Constructive extensions of two results on graphic sequences
• scientific article; zbMATH DE number 1618191
• A simple proof of the Erdos-Gallai theorem on graph sequences

Cites work

• A note on the characterization of digraphic sequences
• A remark on the existence of finite graphs
• A short constructive proof of the Erdős-Gallai characterization of graphic lists
• A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
• Algorithms for constructing graphs and digraphs with given valences and factors
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the degrees of the vertices of a directed graph

This page was built for publication: A constructive proof of the Fulkerson-Ryser characterization of digraphic sequences

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