Algorithms for constructing graphs and digraphs with given valences and factors
From MaRDI portal
Publication:2561241
DOI10.1016/0012-365X(73)90037-XzbMath0263.05122MaRDI QIDQ2561241
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (80)
Forman-Ricci curvature and persistent homology of unweighted complex networks ⋮ Directed Networks with a Differentially Private Bi-degree Sequence ⋮ The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence ⋮ An extremal problem on bigraphic pairs with an \(A\)-connected realization ⋮ A variation of a classical Turán-type extremal problem ⋮ Leaf realization problem, caterpillar graphs and prefix normal words ⋮ A short proof of Kundu's k-factor theorem ⋮ Half-regular factorizations of the complete bipartite graph ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Matrices with prescribed row, column and block sums ⋮ Potentially \(K_{r_{1},r_{2},\dots ,r_{l},r,s}\)-graphic sequences ⋮ Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization ⋮ On factorable bigraphic pairs ⋮ Extremal values of the chromatic number for a given degree sequence ⋮ The Erdős-Jacobson-Lehel conjecture on potentially \(P_k\)-graphic sequence is true ⋮ A note on the characterization of digraphic sequences ⋮ Neighborhood degree lists of graphs ⋮ The characterization for a graphic sequence to have a realization containing \(K _{1,1,s }\) ⋮ Degree sequences and the existence of \(k\)-factors ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem ⋮ Realizing degree sequences as \(Z_3\)-connected graphs ⋮ The k-factor conjecture is true ⋮ Sufficient Conditions for Graphicality of Bidegree Sequences ⋮ Graph realizations: maximum degree in vertex neighborhoods ⋮ A characterization for a graphic sequence to be potentially \(C_{r}\)-graphic ⋮ Methods for the graph realization problem ⋮ The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences ⋮ On triangular biregular degree sequences ⋮ An extremal problem on group connectivity of graphs ⋮ The smallest degree sum that yields potentially \(K_{r+1}-K_3\)-graphic sequences ⋮ Forests and score vectors ⋮ Constructing and sampling directed graphs with given degree sequences ⋮ Graphs and degree sequences. I ⋮ Efficiently Realizing Interval Sequences ⋮ Algorithms ⋮ Graphic sequences with an \(A\)-connected realization ⋮ A parameterized algorithmics framework for degree sequence completion problems in directed graphs ⋮ A complete characterization of graphic sequences with a \(Z_3\)-connected realization ⋮ The mixing time of switch Markov chains: a unified approach ⋮ Configuring Random Graph Models with Fixed Degree Sequences ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices ⋮ Graphic Sequences Have Realizations Containing Bisections of Large Degree ⋮ Graphic sequences and split graphs ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ Recognition of split-graphic sequences ⋮ On the Swap-Distances of Different Realizations of a Graphical Degree Sequence ⋮ Pairs of sequences with a unique realization by bipartite graphs ⋮ Graphic sequences with a realization containing cycles \(C_3, \dots, C_\ell \) ⋮ On multigraphic and potentially multigraphic sequences ⋮ Stability of the Potential Function ⋮ Uniform Sampling of Digraphs with a Fixed Degree Sequence ⋮ Characterization of self-complementary graphs with 2-factors ⋮ The threshold for the Erdős, Jacobson and Lehel conjecture to be true ⋮ Degree sequence and supereulerian graphs ⋮ On balanced bipartitions of graphs ⋮ Construction of Hamiltonian graphs and bigraphs with prescribed degrees ⋮ On potentially K 5-H-graphic sequences ⋮ Potentially K m — G-graphical sequences: A survey ⋮ On potentially H-graphic sequences ⋮ A simple criterion on degree sequences of graphs ⋮ NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs ⋮ Solution of the Hamiltonian problem for self-complementary graphs ⋮ Pythagorean fuzzy digraphs and its application in healthcare center ⋮ Dag Realizations of Directed Degree Sequences ⋮ Minimal Hamiltonian graphs with prescribed degree sets ⋮ A generalization of a conjecture due to Erdös, Jacobson and Lehel ⋮ Split digraphs ⋮ A variation of a conjecture due to Erdös and Sós ⋮ Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic ⋮ Integer-pair sequences with self-complementary realizations ⋮ On the potentially \(P_k\)-graphic sequences ⋮ Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences ⋮ Generalizations of the k-factor theorem ⋮ An extremal problem on graphic sequences with a realization containing every \(\ell \)-tree on \(k\) vertices ⋮ Fast Sequential Creation of Random Realizations of Degree Sequences ⋮ On problems about judicious bipartitions of graphs ⋮ Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size ⋮ Relaxed and approximate graph realizations
Cites Work
This page was built for publication: Algorithms for constructing graphs and digraphs with given valences and factors
