The following pages link to Arc coverings of graphs (Q774916):
Displaying 50 items.
- On extremal hypergraphs for Hamiltonian cycles (Q412248) (← links)
- On saturation games (Q499485) (← links)
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs (Q501276) (← links)
- Turán numbers for disjoint copies of graphs (Q659740) (← links)
- Fault-tolerant Hamiltonian connectivity of the WK-recursive networks (Q726341) (← links)
- The Turán number of sparse spanning graphs (Q744159) (← links)
- Extending cycles in graphs (Q750461) (← links)
- Minimum path cover in quasi-claw-free graphs (Q779733) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- A sufficient condition for a graph to contain two disjoint Hamiltonian cycles (Q915741) (← links)
- On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree (Q931031) (← links)
- Hamilton-chain saturated hypergraphs (Q966015) (← links)
- Rainbow numbers for cycles with pendant edges (Q1014810) (← links)
- Mutually orthogonal Hamiltonian connected graphs (Q1033035) (← links)
- Partition of a bipartite Hamiltonian graph into two cycles (Q1072572) (← links)
- Subgraphs intersecting any Hamiltonian cycle (Q1077429) (← links)
- Scattering number and extremal non-Hamiltonian graphs (Q1109047) (← links)
- On path-coverings and Hamilton-connectivity of finite graphs (Q1148335) (← links)
- Maximale Kreise in Graphen (Q1156816) (← links)
- Smallest maximally nonhamiltonian graphs (Q1166539) (← links)
- Smallest maximally nonhamiltonian graphs. II (Q1199118) (← links)
- On n-hamiltonian line graphs (Q1217716) (← links)
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen (Q1218870) (← links)
- On path connected graphs (Q1226503) (← links)
- Edge sets contained in circuits (Q1229230) (← links)
- Panconnected graphs. II (Q1230793) (← links)
- A lower bound for the circumference of a graph (Q1232423) (← links)
- Path coverings of the vertices of a tree (Q1251231) (← links)
- Relating path coverings to vertex labellings with a condition at distance two (Q1343254) (← links)
- Pancyclic graphs and a conjecture of Bondy and Chvatal (Q1394236) (← links)
- Extremal problems on the Hamiltonicity of claw-free graphs (Q1660262) (← links)
- The Turán number for spanning linear forests (Q1720343) (← links)
- On vertex-disjoint paths in regular graphs (Q1753085) (← links)
- Conditional chromatic numbers with forbidden cycles (Q1805306) (← links)
- Spectral results on Hamiltonian problem (Q1999737) (← links)
- Spectral analogues of Erdős' theorem on Hamilton-connected graphs (Q2007677) (← links)
- Finding long cycles in balanced tripartite graphs: a first step (Q2073190) (← links)
- The maximum size of a nonhamiltonian graph with given order and connectivity (Q2092432) (← links)
- Proof of a conjecture on the spectral radius condition for \([a,b]\)-factors (Q2111929) (← links)
- A note on the 2-power of Hamilton cycles (Q2142646) (← links)
- The formula for Turán number of spanning linear forests (Q2185927) (← links)
- Completion and deficiency problems (Q2200922) (← links)
- The Hamiltonian problem and \(t\)-path traceable graphs (Q2357671) (← links)
- The Ramsey numbers of trees versus \(W_{6}\) or \(W_{7}\) (Q2368712) (← links)
- Geodesic-pancyclic graphs (Q2381818) (← links)
- Large cycles in graphs (Q2548258) (← links)
- On k-path Hamiltonian graphs and line-graphs (Q2551112) (← links)
- Theory of path length distributions. I (Q2561240) (← links)
- Minimal colorings for properly colored subgraphs (Q2563425) (← links)
- On Hamiltonian bipartite graphs (Q2626464) (← links)
