by

Wikipedia Bot (@wikibot, 0)

Graph theory objects

Table of contents

Hamiltonian paths and cycles

Barnette's conjecture

Hamiltonian completion

Herschel graph

Hypohamiltonian graph

Pancyclic graph

Shortness exponent

Subhamiltonian graph

Tait's conjecture

Walther graph

Acyclic orientation

Bipolar orientation

Blossom tree (graph theory)

Chordal completion

Clique (graph theory)

Core (graph theory)

Cycle (graph theory)

Edge-graceful labeling

Edge cycle cover

End (graph theory)

Eternal dominating set

Eulerian path

Graceful labeling

Graph center

Hamiltonian decomposition

Incidence (graph)

Induced path

Level structure

Map (graph theory)

Minimum cut

Modular decomposition

Multiple edges

Neighbourhood (graph theory)

Orientation (graph theory)

Path cover

Peripheral cycle

Sachs subgraph

Skew partition

Split (graph theory)

Unfriendly partition

Universal vertex

 Ancestors (4)

View article source

Discussion (0)

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.

See all articles in the same topic Create my own version