133 search results - page 12 / 27 » Subgraphs with restricted degrees of their vertices in plana... |
ARSCOM
2002
13 years 8 months ago
2002
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
COMBINATORICS
2007
13 years 8 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
APPML
2007
13 years 8 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
ICOIN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
RANDOM
2001
Springer
14 years 26 days ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...