by

Wikipedia Bot (@wikibot, 0)

Graph theory objects

Table of contents

Hamiltonian paths and cycles

 0  0 

Barnette's conjecture

 0  0 

Hamiltonian completion

 0  0 

Herschel graph

 0  0 

Hypohamiltonian graph

 0  0 

Pancyclic graph

 0  0 

Shortness exponent

 0  0 

Subhamiltonian graph

 0  0 

Tait's conjecture

 0  0 

Walther graph

 0  0 

Acyclic orientation

 0  0 

Bipolar orientation

 0  0 

Blossom tree (graph theory)

 0  0 

Chordal completion

 0  0 

Clique (graph theory)

 0  0 

Core (graph theory)

 0  0 

Cycle (graph theory)

 0  0 

Edge-graceful labeling

 0  0 

Edge cycle cover

 0  0 

End (graph theory)

 0  0 

Eternal dominating set

 0  0 

Eulerian path

 0  0 

Graceful labeling

 0  0 

Graph center

 0  0 

Hamiltonian decomposition

 0  0 

Incidence (graph)

 0  0 

Induced path

 0  0 

Level structure

 0  0 

Map (graph theory)

 0  0 

Minimum cut

 0  0 

Modular decomposition

 0  0 

Multiple edges

 0  0 

Neighbourhood (graph theory)

 0  0 

Orientation (graph theory)

 0  0 

Path cover

 0  0 

Peripheral cycle

 0  0 

Sachs subgraph

 0  0 

Skew partition

 0  0 

Split (graph theory)

 0  0 

Unfriendly partition

 0  0 

Universal vertex

 0  0 

 Ancestors (4)

 View article source

 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.

  See all articles in the same topic + Create my own version