Degree realization with maximum matching
From MaRDI portal
Cites work
- A factorization theorem for a certain class of graphs
- A Rao-type characterization for a sequence to have a realization containing a split graph
- A remark on the existence of finite graphs
- A short constructive proof of A.R. Rao's characterization of potentially \(K_{r+1}\)-graphic sequences
- Algorithms for constructing graphs and digraphs with given valences and factors
- An algorithmic proof of Tutte's f-factor theorem
- Construction of Hamiltonian graphs and bigraphs with prescribed degrees
- Degree realization with minimum dominating set
- Generalizations of the k-factor theorem
- scientific article; zbMATH DE number 3169205 (Why is no real title available?)
- scientific article; zbMATH DE number 3758373 (Why is no real title available?)
- Largest domination number and smallest independence number of forests with given degree sequence
- Max flows in O(nm) time, or better
- On factorable degree sequences
- On matching numbers of tree and bipartite degree sequences
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- On realization graphs of degree sequences
- On the swap-distances of different realizations of a graphical degree sequence
- Simplified existence theorems for \((g,f)\)-factors
- Smallest domination number and largest independence number of graphs and forests with given degree sequence
- Some Properties of Graphs with Multiple Edges
- The k-factor conjecture is true
- Zero-one matrices with zero trace
This page was built for publication: Degree realization with maximum matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363373)
