641 search results - page 66 / 129 » On Planar Quasi-Parity Graphs |
161
click to vote
JGT
2006
15 years 6 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
150
click to vote
FOCS
1995
IEEE
15 years 9 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
134
click to vote
DAM
2008
15 years 6 months ago
2008
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transv...
147
click to vote
DM
2008
15 years 6 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
141
click to vote
ENDM
2007
15 years 6 months ago
2007
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most 3