58 search results - page 5 / 12 » Connectivity keeping edges in graphs with large minimum degr... |
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
COMBINATORICS
2006
13 years 6 months ago
2006
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
COMGEO
2007
ACM
13 years 6 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
STACS
2009
Springer
14 years 1 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
JCT
2010
13 years 5 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...