136 search results - page 13 / 28 » On Touching Triangle Graphs |
95
Voted
IPL
2007
14 years 11 months ago
2007
This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such ...
108
click to vote
IMR
1998
Springer
15 years 3 months ago
1998
Springer
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
101
Voted
DM
2002
14 years 11 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
70
Voted
GD
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we consider the problem of simultaneous drawing of two graphs. The goal is to produce aesthetically pleasing drawings for the two graphs by means of a heuri...
115
click to vote
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...