Pages that link to "Item:Q1850576"
From MaRDI portal
The following pages link to Subgraph coverings and edge switchings (Q1850576):
Displaying 16 items.
- Dicycle cover of Hamiltonian oriented graphs (Q275871) (← links)
- Small cycle covers of 3-connected cubic graphs (Q615999) (← links)
- Cycles in 2-connected graphs (Q705891) (← links)
- Small cycle cover of 2-connected cubic graphs (Q1402087) (← links)
- Covers of Eulerian graphs (Q1417961) (← links)
- Graphs with almost all edges in long cycles (Q1756098) (← links)
- Path decompositions and Gallai's conjecture (Q1767666) (← links)
- How many circuits determine an oriented matroid? (Q1786051) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture (Q2221920) (← links)
- The codiameter of a 2-connected graph (Q2463471) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- Cycle packing (Q5256386) (← links)
- Maximizing the number of independent sets of fixed size in Kn‐covered graphs (Q6056803) (← links)
- The Number of Cliques in Graphs Covered by Long Cycles (Q6098464) (← links)
- Towards the Erdős-Gallai cycle decomposition conjecture (Q6184561) (← links)