6740 search results - page 227 / 1348 » An s -Hamiltonian Line Graph Problem |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
ENDM
2010
13 years 11 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
HPCC
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
SLP
1997
14 years 4 days ago
1997
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
GD
2005
Springer
14 years 4 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...