5 search results - page 1 / 1 » On Subgraphs Induced by Transversals in Vertex-Partitions of... |
134
Voted
COMBINATORICS
2006
14 years 10 months ago
2006
75
Voted
JGT
2007
14 years 10 months ago
2007
: Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In th...
90
Voted
COMBINATORICA
2006
14 years 10 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
89
Voted
GD
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
86
Voted
COMBINATORICS
2006
14 years 10 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...