Valencies of graphs with 1-factors
From MaRDI portal
Publication:1845898
DOI10.1007/BF02020548zbMATH Open0286.05126MaRDI QIDQ1845898
No author found.
Publication date: 1974
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Related Items (14)
Packing of graphic n-tuples ⋮ The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence ⋮ Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ On asymmetric \((0,1)\)-matrices with given row and column sum vectors ⋮ The structure matrix and a generalization of Ryser's maximum term rank formula ⋮ A short proof of Kundu's k-factor theorem ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Degree sequences and the existence of \(k\)-factors ⋮ On Ryser's maximum term rank formula ⋮ Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem ⋮ Subgraphs and their degree sequences of a digraph ⋮ A note on packing of graphic \(n\)-tuples ⋮ The class of 2-multigraphs with a prescribed degree sequence ⋮ Navigating between packings of graphic sequences
This page was built for publication: Valencies of graphs with 1-factors
