Pages that link to "Item:Q3275433"
From MaRDI portal
The following pages link to On the Problem of Decomposing a Graph into <i>n</i> Connected Factors (Q3275433):
Displaying 50 items.
- Circular flows via extended Tutte orientations (Q2200925) (← links)
- Packing plane spanning trees into a point set (Q2206739) (← links)
- On \(( s , t )\)-supereulerian graphs with linear degree bounds (Q2222943) (← links)
- An analogue of Edmonds' branching theorem for infinite digraphs (Q2225436) (← links)
- Toughness in pseudo-random graphs (Q2225447) (← links)
- Connectivity for quantum graphs (Q2226415) (← links)
- The minimum size of a graph with given tree connectivity (Q2227103) (← links)
- Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number (Q2228493) (← links)
- Polynomially determine if a graph is \((s,3)\)-supereulerian (Q2231716) (← links)
- On the notion of generalized minor in topological network theory and matroids (Q2250913) (← links)
- Note on edge-disjoint spanning trees and eigenvalues (Q2250921) (← links)
- Extremal infinite graph theory (Q2275380) (← links)
- Monochromatic \(k\)-edge-connection colorings of graphs (Q2280002) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- Group connectivity and group coloring: small groups versus large groups (Q2309219) (← links)
- Spanning tree packing number and eigenvalues of graphs with given girth (Q2321370) (← links)
- Orientations and detachments of graphs with prescribed degrees and connectivity (Q2339815) (← links)
- Decomposition into two trees with orientation constraints (Q2339817) (← links)
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs (Q2341720) (← links)
- Degree sequence realizations with given packing and covering of spanning trees (Q2341721) (← links)
- Spanning trees and spanning Eulerian subgraphs with small degrees (Q2342618) (← links)
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs (Q2359795) (← links)
- Homomorphism bounded classes of graphs (Q2368718) (← links)
- Edge vulnerability parameters of split graphs (Q2371083) (← links)
- Avoider-Enforcer games (Q2371294) (← links)
- Vertex-coloring 3-edge-weighting of some graphs (Q2374171) (← links)
- Separation of partition inequalities with terminals (Q2386198) (← links)
- On reachability mixed arborescence packing (Q2419578) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Edge-disjoint spanning trees and eigenvalues of graphs (Q2435485) (← links)
- Edge-disjoint spanning trees and eigenvalues (Q2442253) (← links)
- Arc-disjoint paths and trees in 2-regular digraphs (Q2444565) (← links)
- Decomposing graphs into paths of fixed length (Q2448964) (← links)
- Spanning cycles in regular matroids without \(M^{*}(K_{5})\) minors (Q2462341) (← links)
- Matching edges and faces in polygonal partitions (Q2462737) (← links)
- Pebble game algorithms and sparse graphs (Q2476285) (← links)
- Partitions of complete geometric graphs into plane trees (Q2489020) (← links)
- Arboricity and tree-packing in locally finite graphs (Q2490258) (← links)
- The characterization of sufficient visibility in the direct reference plane approach for multiple views with missing data (Q2508358) (← links)
- Edge vulnerability parameters of bisplit graphs (Q2519517) (← links)
- Graphs with forbidden subgraphs (Q2547895) (← links)
- On flows in bidirected graphs (Q2568493) (← links)
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs (Q2573645) (← links)
- Network reinforcement (Q2583121) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- Algorithms for finding a rooted \((k,1)\)-edge-connected orientation (Q2636819) (← links)
- On spanning disjoint paths in line graphs (Q2637723) (← links)
- Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures (Q2640622) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)
- The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties (Q2686111) (← links)
