Pages that link to "Item:Q4534211"
From MaRDI portal
The following pages link to <i>K</i><sub>4</sub><sup>−</sup>‐factor in a graph (Q4534211):
Displayed 19 items.
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- The extremal function for two disjoint cycles (Q745932) (← links)
- Sharp minimum degree conditions for the existence of disjoint theta graphs (Q820839) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- \(K_{1,3}\)-factors in graphs (Q998329) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Disjoint cliques in claw-free graphs (Q1709414) (← links)
- A vertex cover with chorded 4-cycles (Q1942183) (← links)
- Results and problems on chorded cycles: a survey (Q2102760) (← links)
- The minimum degree threshold for perfect graph packings (Q2149489) (← links)
- Disjoint cycles and chorded cycles in a graph with given minimum degree (Q2174581) (← links)
- Disjoint \(K_4^-\) in claw-free graphs with minimum degree at least five (Q2258124) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- Minimum degree conditions for vertex-disjoint even cycles in large graphs (Q2439893) (← links)
- Perfect packings with complete graphs minus an edge (Q2461771) (← links)
- Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (Q2689114) (← links)
- Disjoint Even Cycles Packing (Q2851449) (← links)
- The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
- Graph Tilings in Incompatibility Systems (Q6046822) (← links)