Home » Keyword index

path


Graph Theory » Basic G.T. » Paths

Linial-Berge path partition duality ★★★

Author(s): Berge; Linial

Conjecture   The minimum $ k $-norm of a path partition on $ D $ is no more than the maximal size of an induced $ k $-colorable subgraph.

Keywords: coloring; partition; path

Posted by berger
updated September 19th, 2007
2 comments
Graph Theory » Algebraic G.T.

Hamiltonian paths and cycles in vertex transitive graphs ★★★

Author(s): Lovasz

Problem   Does every connected vertex-transitive graph have a Hamiltonian path?

Keywords: cycle; hamiltonian; path; vertex-transitive

Posted by mdevos
updated March 18th, 2007
add new comment
Syndicate content