Some Properties of Graphs with Multiple Edges
From MaRDI portal
Publication:5341587
DOI10.4153/CJM-1965-016-2zbMath0132.21002OpenAlexW2072322181MaRDI QIDQ5341587
Alan J. Hoffman, M. H. McAndrew, D. R. Fulkerson
Publication date: 1965
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1965-016-2
Related Items (71)
The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence ⋮ On realization graphs of degree sequences ⋮ Structure and recognition of domishold graphs ⋮ Unnamed Item ⋮ Factors and factorizations of graphs—a survey ⋮ Seven criteria for integer sequences being graphic ⋮ Ehrhart series for connected simple graphs ⋮ Graphical sequences of some family of induced subgraphs ⋮ The A4-structure of a graph ⋮ Degree sequences of highly irregular graphs ⋮ A polynomial algorithm for b-matchings: An alternative approach ⋮ Hall's and Kőnig's theorem in graphs and hypergraphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Matrices with prescribed row, column and block sums ⋮ On complete intersection toric ideals of graphs ⋮ On certain trees with the same degree sequence ⋮ Dually vertex-oblique graphs ⋮ New results on degree sequences of uniform hypergraphs ⋮ Unnamed Item ⋮ On fractional realizations of graph degree sequences ⋮ Gorenstein homogeneous subrings of graphs ⋮ A Rao-type characterization for a sequence to have a realization containing a split graph ⋮ A semigroup proof of the bounded degree case of S.B. Rao's conjecture on degree sequences and a bipartite analogue ⋮ Subgraphs and their degree sequences of a digraph ⋮ Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two ⋮ On 2-switches and isomorphism classes ⋮ A characterization for a sequence to be potentially \({K_{r+1}-e}\)-graphic ⋮ Properties of unique realizations - a survey ⋮ Graphs and degree sequences. I ⋮ Switching codes and designs ⋮ A Rao-type characterization for a sequence to have a realization containing an arbitrary subgraph \(H\) ⋮ Monotonizing linear programs with up to two nonzeroes per column ⋮ On the Bruhat order of labeled graphs ⋮ INDISPENSABLE BINOMIALS OF FINITE GRAPHS ⋮ Non-minimal degree-sequence-forcing triples ⋮ Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm ⋮ Box-threshold graphs ⋮ Adjacency relationships forced by a degree sequence ⋮ Recognition of split-graphic sequences ⋮ Factors in graphs with odd-cycle property ⋮ Convexity of degree sequences ⋮ A factorization theorem for a certain class of graphs ⋮ On multigraphic and potentially multigraphic sequences ⋮ Simple directed trees ⋮ Graphs with degrees from prescribed intervals ⋮ Graph classes characterized both by forbidden subgraphs and degree sequences ⋮ Stability of the Potential Function ⋮ Dihedral transportation and (0, 1)-matrix classes ⋮ Degree sequences of graphs containing a cycle with prescribed length ⋮ Regularisable graphs I ⋮ Simplified existence theorems for \((g,f)\)-factors ⋮ On maximal graphical partitions that are the nearest to a given graphical partition ⋮ Normal polytopes arising from finite graphs ⋮ A generalization of a conjecture due to Erdös, Jacobson and Lehel ⋮ Conditions for sequences to be r-graphic ⋮ On forcibly hereditary P-graphical sequences ⋮ On f-factors of a graph ⋮ Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic ⋮ Integer-pair sequences with self-complementary realizations ⋮ Matchings and matching extensions in graphs ⋮ Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences ⋮ The realization graph of a degree sequence with majorization gap 1 is Hamiltonian ⋮ The network flows approach for matrices with given row and column sums ⋮ Cliques in realization graphs ⋮ Normality of semigroups with some links to graph theory. ⋮ Degree sequences of matrogenic graphs ⋮ Once more on matrogenic graphs ⋮ On normal matrices of zeros and ones with fixed row sum ⋮ Minimal forbidden sets for degree sequence characterizations ⋮ A property of adjacency matrices of realizations of pair sequences ⋮ Roof duality, complementation and persistency in quadratic 0–1 optimization
This page was built for publication: Some Properties of Graphs with Multiple Edges
