Pages that link to "Item:Q1213883"
From MaRDI portal
The following pages link to On maximal circuits in directed graphs (Q1213883):
Displaying 18 items.
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Extending cycles in directed graphs (Q580359) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- Number of arcs and cycles in digraphs (Q799688) (← links)
- About some cyclic properties in digraphs (Q1058520) (← links)
- Cycles in strong oriented graphs (Q1158163) (← links)
- Hamiltonian paths and cycles, number of arcs and independence number in digraphs (Q1199482) (← links)
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs (Q1234553) (← links)
- A family of perfect factorisations of complete bipartite graphs (Q1601439) (← links)
- The maximum number of cliques in graphs without long cycles (Q1682216) (← links)
- Stability in the Erdős-Gallai theorem on cycles and paths. II (Q1709520) (← links)
- On \(r\)-uniform hypergraphs with circumference less than \(r\) (Q2309554) (← links)
- On 2-connected hypergraphs with no long cycles (Q2335701) (← links)
- Long cycles in subgraphs of (pseudo)random directed graphs (Q2897207) (← links)
- Long cycles in graphs and digraphs (Q3439406) (← links)
- Extensions of the Erdős–Gallai theorem and Luo’s theorem (Q5222574) (← links)
- On the size of maximally non-hamiltonian digraphs (Q5225023) (← links)
- Non-Hamiltonian graphs with large minimum degree (Q6178660) (← links)
