An isolated vertex has degree zero.
Ancestors (6)
Incoming links (39)
- 2-core of a graph
- Bipartite graph
- Bipartition of a graph
- Critical-window connectivity probability of a binomial random graph
- Edge cover
- Edge cover and matching identity
- Edge support of a graph
- Entropy bound for graphs with isolated-vertex-free intersections
- Euler circuit
- Eulerian graph
- Eulerian trail
- Hall obstruction
- Independent vertex cover
- Leaf pruning for the 2-core
- Logarithmic-regime giant component
- Marked-set connectivity threshold
- Minimum-weight edge cover
- Minimum-weight edge cover by matching savings
- Mycielskian chromatic increase
- Past exam of the computer science course of the University of Oxford / 2018 / Algorithms / 3 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2018 / Algorithms / 3 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 3 / d / iii / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 3 / d / ii / Solution
- Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 3 / d / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 28 / 3 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 12 / 2 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 14 / 4 / a / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 14 / 4 / c / Solution
- Past exam of the mathematics course of the University of Cambridge / 2006 / iii / Paper 14 / 4 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 9 / 1 / ii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2012 / iii / Paper 9 / 1 / i / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 13 / 2 / iii / Solution
- Past exam of the mathematics course of the University of Cambridge / 2022 / ii / Paper 4 / 17F / Solution
- Path-cycle matching
- Perfect matching
- Star forest
- Tree-component expectation in the Erdős-Rényi model
- Vertex cover
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.