On fractional realizations of graph degree sequences
From MaRDI portal
Publication:405210
zbMath1300.05266arXiv1310.1112MaRDI QIDQ405210
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.1112
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (2)
Split graphs and Nordhaus-Gaddum graphs ⋮ The principal Erdős-Gallai differences of a degree sequence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hereditary unigraphs and Erdős-Gallai equalities
- Rao's degree sequence conjecture
- The polytope of degree sequences
- The splittance of a graph
- Linear recognition of pseudo-split graphs
- Decomposition of graphical sequences and unigraphs
- Adjacency relationships forced by a degree sequence
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Fractional matroid matchings
- Fractional perfect \(b\)-matching polytopes. I: General theory
- Establishing the matching polytope
- A remark on the existence of finite graphs
- Degree-based graph construction
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Properties of vertex packing and independence system polyhedra
- Integer Programming: Methods, Uses, Computations
- Some Properties of Graphs with Multiple Edges
- On the extreme points of a certain convex polytope
This page was built for publication: On fractional realizations of graph degree sequences
