Sciweavers

871 search results - page 37 / 175
» The vertex-cover polynomial of a graph
Sort
View
DM
2000
80views more  DM 2000»
14 years 9 months ago
An attempt to classify bipartite graphs by chromatic polynomials
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles...
DM
2002
49views more  DM 2002»
14 years 9 months ago
The vertex-cover polynomial of a graph
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Char...
60
Voted
JAL
2000
63views more  JAL 2000»
14 years 9 months ago
Polynomial-Time Analysis of Toroidal Periodic Graphs
Franz Höfting, Egon Wanke
43
Voted
DM
1998
48views more  DM 1998»
14 years 9 months ago
Lattices in graphs with polynomial growth
András Lukács, Norbert Seifter
DMTCS
2011
261views Mathematics» more  DMTCS 2011»
13 years 9 months ago
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
Yury Person, Mathias Schacht