# Category:Graph theory objects

Computing portal |

Here is a list of articles in the category **Graph theory objects** of the Computing portal that unifies foundations of mathematics and computations using computers. Structures consisting of sets of edges or vertices in graphs, or additional information on the edges and vertices of graphs.

## Subcategories

This category has the following 2 subcategories, out of 2 total.

## Pages in category "Graph theory objects"

The following 58 pages are in this category, out of 58 total.

### (

- (a, b)-decomposition
*(computing)*

### A

- Acyclic orientation
*(computing)*

### B

- Bipolar orientation
*(computing)* - Blossom tree (graph theory)
*(computing)* - Bramble (graph theory)
*(computing)*

### C

- Chordal completion
*(computing)* - Clique (graph theory)
*(computing)* - Clique cover
*(computing)* - Core (graph theory)
*(computing)* - Cycle (graph theory)
*(computing)* - Cycle double cover
*(computing)*

### D

- Directed cycle
*(computing)* - Dominating set
*(computing)*

### E

- Ear decomposition
*(computing)* - Edge cycle cover
*(computing)* - Edge-graceful labeling
*(computing)* - End (graph theory)
*(computing)* - Eternal dominating set
*(computing)* - Eulerian path
*(computing)*

### F

- Feedback arc set
*(computing)* - Friendly-index set
*(computing)*

### G

- Graceful labeling
*(computing)* - Graph center
*(computing)* - Graph factorization
*(computing)*

### H

- Hamiltonian decomposition
*(computing)* - Hamiltonian path
*(computing)* - Haven (graph theory)
*(computing)*

### I

- Incidence (graph)
*(computing)* - Independent set (graph theory)
*(computing)* - Induced matching
*(computing)* - Induced path
*(computing)* - Induced subgraph
*(computing)* - Interval (graph theory)
*(computing)*

### L

- Level structure
*(computing)*

### M

- Map (graph theory)
*(computing)* - Maximal independent set
*(computing)* - Maximum cut
*(computing)* - Minimum cut
*(computing)* - Graph minor
*(computing)* - Modular decomposition
*(computing)* - Multiple edges
*(computing)*

### N

- Neighbourhood (graph theory)
*(computing)* - Nonblocker
*(computing)*

### O

- Odd cycle transversal
*(computing)* - Orientation (graph theory)
*(computing)*

### P

- Path (graph theory)
*(computing)* - Path cover
*(computing)* - Peripheral cycle
*(computing)* - Pfaffian orientation
*(computing)* - Planar cover
*(computing)*

### R

- Rainbow matching
*(computing)*

### S

- Skew partition
*(computing)* - Split (graph theory)
*(computing)* - Strong orientation
*(computing)*

### T

- Tree decomposition
*(computing)* - Trémaux tree
*(computing)*

### U

- Unique sink orientation
*(computing)* - Universal vertex
*(computing)*