21 search results - page 2 / 5 » A note on degree-constrained subgraphs |
DM
2006
13 years 5 months ago
2006
We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph of G. The condition is derived from a re...
DM
2000
13 years 5 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
EJC
2002
13 years 5 months ago
2002
In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmetric generating set of a finitely-generated group . Two nodes are connected by a...
SIAMDM
1998
13 years 5 months ago
1998
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
FOCS
2008
IEEE
14 years 7 days ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...