4 search results - page 1 / 1 » A new bound for parsimonious edge-colouring of graphs with m... |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
DM
2008
13 years 4 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
GD
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. In this paper we present an algorithm for 3-dimensional orthogonal graph drawing based on the movement of vertices from an initial layout along the main diagonal of a cub...
SIROCCO
2004
13 years 6 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...