5473 search results - page 211 / 1095 » On the graph isomorphism problem |
140
click to vote
SIAMDM
2008
15 years 7 months ago
2008
We show that every triangle-free graph on the double torus is 4-colorable. This settles a problem raised by Gimbel and Thomassen [Trans. Amer. Math. Soc. 349 (1997), 4555
240
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
199
click to vote
VIZSEC
2004
Springer
16 years 16 days ago
2004
Springer
We describe a framework for managing network attack graph complexity through interactive visualization, which includes hierarchical aggregation of graph elements. Aggregation coll...
166
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
175
click to vote
TALG
2008
15 years 7 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...