Pages that link to "Item:Q5732669"
From MaRDI portal
The following pages link to Existence of k-edge connected ordinary graphs with prescribed degrees (Q5732669):
Displaying 20 items.
- Realizing degree sequences with \(k\)-edge-connected uniform hypergraphs (Q389497) (← links)
- Network synchronization: Spectral versus statistical properties (Q858503) (← links)
- Degree sequence and supereulerian graphs (Q998406) (← links)
- Sequences with a unique realization by simple graphs (Q1214448) (← links)
- Some special realizations of partition matrix sequences (Q1309467) (← links)
- Combined connectivity augmentation and orientation problems (Q1410691) (← links)
- Regular factors of simple regular graphs and factor-spectra (Q1584246) (← links)
- Efficient counting of degree sequences (Q1712538) (← links)
- Graph extensions, edit number and regular graphs (Q1732121) (← links)
- Bounds of the number of disjoint spanning trees (Q1844855) (← links)
- Independence number of graphs and line graphs of trees by means of omega invariant (Q2174305) (← links)
- On the existence of super edge-connected graphs with prescribed degrees (Q2449175) (← links)
- Tough graphs and Hamiltonian circuits. (Reprint) (Q2497990) (← links)
- Tough graphs and Hamiltonian circuits. (Q2558871) (← links)
- On the simultaneous edge coloring of graphs (Q2931912) (← links)
- Characterization of Digraphic Sequences with Strongly Connected Realizations (Q2958207) (← links)
- Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (Q5219669) (← links)
- On the existence of N‐connected graphs with prescribed degrees (n ≧ 2) (Q5672673) (← links)
- Forcibly bipartite and acyclic (uni-)graphic sequences (Q6041871) (← links)
- Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem (Q6142661) (← links)
