Some Properties of Graphs with Multiple Edges
From MaRDI portal
Cited in
(80)- A generalization of a conjecture due to Erdös, Jacobson and Lehel
- Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic
- Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences
- The network flows approach for matrices with given row and column sums
- Structure and recognition of domishold graphs
- A polynomial algorithm for b-matchings: An alternative approach
- Matrices with prescribed row, column and block sums
- Subgraphs and their degree sequences of a digraph
- Properties of unique realizations - a survey
- Factors in graphs with odd-cycle property
- Simple directed trees
- Graphs with degrees from prescribed intervals
- Regularisable graphs I
- Normal polytopes arising from finite graphs
- The realization graph of a degree sequence with majorization gap 1 is Hamiltonian
- On normal matrices of zeros and ones with fixed row sum
- Degree sequences of highly irregular graphs
- Monotonizing linear programs with up to two nonzeroes per column
- Matchings and matching extensions in graphs
- Hall's and Kőnig's theorem in graphs and hypergraphs
- On the Bruhat order of labeled graphs
- Adjacency relationships forced by a degree sequence
- Simplified existence theorems for \((g,f)\)-factors
- On forcibly hereditary P-graphical sequences
- On f-factors of a graph
- Integer-pair sequences with self-complementary realizations
- On multigraphic and potentially multigraphic sequences
- Cliques in realization graphs
- On certain trees with the same degree sequence
- Recognition of split-graphic sequences
- A factorization theorem for a certain class of graphs
- On maximal graphical partitions that are the nearest to a given graphical partition
- Minimal forbidden sets for degree sequence characterizations
- The structure matrix of the class of r-multigraphs with a prescribed degree sequence
- Ehrhart series for connected simple graphs
- A characterization for a sequence to be potentially \({K_{r+1}-e}\)-graphic
- A Rao-type characterization for a sequence to have a realization containing an arbitrary subgraph H
- Normality of semigroups with some links to graph theory.
- On realization graphs of degree sequences
- The A₄-structure of a graph
- Decomposing semi-complete multigraphs and directed graphs into paths of length two
- Degree sequences of graphs containing a cycle with prescribed length
- Graphical sequences of some family of induced subgraphs
- Box-threshold graphs
- On complete intersection toric ideals of graphs
- A property of adjacency matrices of realizations of pair sequences
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Factors and factorizations of graphs—a survey
- Graphs and degree sequences. I
- New results on degree sequences of uniform hypergraphs
- Seven criteria for integer sequences being graphic
- On fractional realizations of graph degree sequences
- 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
- Convexity of degree sequences
- On 2-switches and isomorphism classes
- scientific article; zbMATH DE number 2156369 (Why is no real title available?)
- Stability of the potential function
- Dihedral transportation and (0, 1)-matrix classes
- Non-minimal degree-sequence-forcing triples
- Graph classes characterized both by forbidden subgraphs and degree sequences
- INDISPENSABLE BINOMIALS OF FINITE GRAPHS
- scientific article; zbMATH DE number 7535774 (Why is no real title available?)
- Gorenstein homogeneous subrings of graphs
- Switching codes and designs
- Graphs with degree sequence \(\{ ( m - 1 )^m , ( n - 1 )^n \}\) and \(\{ m^n , n^m \}\)
- On a conjecture that strengthens Kundu's k-factor theorem
- Critically fixed Thurston maps: classification, recognition, and twisting
- Minimum vertex weighted deficiency of (g,f)-factors: A greedy algorithm
- Reducing graphs by lifting rotations of edges to splittable graphs
- The hereditary closure of the unigraphs
- On the equivalence between Sachs extendability and Sachs criticality
- Degree realization with minimum dominating set
- Degree realization with maximum matching
- Realization of temporally connected graphs based on degree sequences
- Conditions for sequences to be r-graphic
- Degree sequences of matrogenic graphs
- Once more on matrogenic graphs
- Graph factors and factorization: 1985--2003: a survey
- Dually vertex-oblique graphs
This page was built for publication: Some Properties of Graphs with Multiple Edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5341587)