Pages that link to "Item:Q1970699"
From MaRDI portal
The following pages link to Gallai's conjecture for disconnected graphs (Q1970699):
Displaying 18 items.
- Disproof of a conjecture on the existence of the path-recursive period for a connected graph (Q1587898) (← links)
- Disconnected \(g_c\)-critical graphs (Q1680488) (← links)
- Minimal path decomposition of complete bipartite graphs (Q1743479) (← links)
- Path decompositions and Gallai's conjecture (Q1767666) (← links)
- On computing the path number of a graph (Q2132346) (← links)
- Path decompositions of triangle-free graphs (Q2138955) (← links)
- Decompositions of triangle-free 5-regular graphs into paths of length five (Q2352046) (← links)
- Path partitions of almost regular graphs (Q2800782) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- Cycle packing (Q5256386) (← links)
- Gallai's Conjecture For Graphs of Girth at Least Four (Q5417821) (← links)
- Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517) (← links)
- Gallai's conjecture on path decompositions (Q6047576) (← links)
- Mader's conjecture for graphs with small connectivity (Q6057633) (← links)
- 1‐independent percolation on ℤ2×Kn (Q6076214) (← links)
- Towards the Erdős-Gallai cycle decomposition conjecture (Q6184561) (← links)
- The problem of path decomposition for graphs with treewidth at most 4 (Q6494937) (← links)
- Separating path systems of almost linear size (Q6571612) (← links)
