Sufficient Conditions for Graphicality of Bidegree Sequences (Q2953405): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1511.02411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on regular Ramsey graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of a Class of (0,1)-Matrices Covering a given Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recurrence for counting graphical partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of graphical partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the characterization of digraphic sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp refinement of a result of Zverovich-Zverovich / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the realization of a (p,s)-digraph with prescribed degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed random graphs with given degree distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected components in random graphs with given expected degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark concerning graphical sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphical partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-one matrices with zero trace / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing and sampling directed graphs with given degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for constructing graphs and digraphs with given valences and factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced criteria for degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical basis partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confirming two conjectures about the integer partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Matrices of Zeros and Ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-Entropy Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the theory of graphic sequences / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963971663 / rank
 
Normal rank

Latest revision as of 08:37, 30 July 2024

scientific article
Language Label Description Also known as
English
Sufficient Conditions for Graphicality of Bidegree Sequences
scientific article

    Statements

    Sufficient Conditions for Graphicality of Bidegree Sequences (English)
    0 references
    4 January 2017
    0 references
    degree sequence
    0 references
    directed graph
    0 references
    graphic
    0 references
    graphicality
    0 references
    Gale-Ryser theorem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references