Pages that link to "Item:Q5341587"

The following pages link to Some Properties of Graphs with Multiple Edges (Q5341587):

Displaying 50 items.

• On realization graphs of degree sequences (Q284753) (← links)
• Graphical sequences of some family of induced subgraphs (Q307914) (← links)
• On complete intersection toric ideals of graphs (Q364718) (← links)
• New results on degree sequences of uniform hypergraphs (Q396927) (← links)
• On fractional realizations of graph degree sequences (Q405210) (← links)
• A Rao-type characterization for a sequence to have a realization containing a split graph (Q409361) (← links)
• A semigroup proof of the bounded degree case of S.B. Rao's conjecture on degree sequences and a bipartite analogue (Q414650) (← links)
• On 2-switches and isomorphism classes (Q442300) (← links)
• Non-minimal degree-sequence-forcing triples (Q497308) (← links)
• Switching codes and designs (Q658111) (← links)
• Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm (Q686268) (← links)
• Conditions for sequences to be r-graphic (Q759166) (← links)
• Degree sequences of matrogenic graphs (Q797597) (← links)
• Once more on matrogenic graphs (Q797598) (← links)
• Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
• Dually vertex-oblique graphs (Q878622) (← links)
• A generalization of a conjecture due to Erdös, Jacobson and Lehel (Q1025530) (← links)
• Conditions for \(r\)-graphic sequences to be potentially \(K^{(r)}_{m+1}\)-graphic (Q1045022) (← links)
• Unidigraphic and unigraphic degree sequences through uniquely realizable integer-pair sequences (Q1050376) (← links)
• The network flows approach for matrices with given row and column sums (Q1052337) (← links)
• Structure and recognition of domishold graphs (Q1087562) (← links)
• A polynomial algorithm for b-matchings: An alternative approach (Q1109690) (← links)
• Matrices with prescribed row, column and block sums (Q1117232) (← links)
• Subgraphs and their degree sequences of a digraph (Q1148915) (← links)
• Properties of unique realizations - a survey (Q1161530) (← links)
• Factors in graphs with odd-cycle property (Q1210551) (← links)
• Simple directed trees (Q1227630) (← links)
• Graphs with degrees from prescribed intervals (Q1227759) (← links)
• Regularisable graphs I (Q1251673) (← links)
• Normal polytopes arising from finite graphs (Q1270039) (← links)
• The realization graph of a degree sequence with majorization gap 1 is Hamiltonian (Q1300907) (← links)
• On normal matrices of zeros and ones with fixed row sum (Q1307234) (← links)
• Degree sequences of highly irregular graphs (Q1356710) (← links)
• Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
• Matchings and matching extensions in graphs (Q1584277) (← links)
• Hall's and Kőnig's theorem in graphs and hypergraphs (Q1660258) (← links)
• On the Bruhat order of labeled graphs (Q1732096) (← links)
• Adjacency relationships forced by a degree sequence (Q1756108) (← links)
• Simplified existence theorems for \((g,f)\)-factors (Q1813711) (← links)
• On forcibly hereditary P-graphical sequences (Q1820175) (← links)
• On f-factors of a graph (Q1820798) (← links)
• Integer-pair sequences with self-complementary realizations (Q1838983) (← links)
• On multigraphic and potentially multigraphic sequences (Q2013881) (← links)
• Cliques in realization graphs (Q2092412) (← links)
• On certain trees with the same degree sequence (Q2172397) (← links)
• Recognition of split-graphic sequences (Q2254547) (← links)
• A factorization theorem for a certain class of graphs (Q2264778) (← links)
• On maximal graphical partitions that are the nearest to a given graphical partition (Q2306054) (← links)
• Minimal forbidden sets for degree sequence characterizations (Q2344782) (← links)
• The structure matrix of the class of \(r\)-multigraphs with a prescribed degree sequence (Q2365681) (← links)