330 search results - page 18 / 66 » Compressing Bounded Degree Graphs |
129
click to vote
SAC
2000
ACM
15 years 6 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
116
click to vote
IPL
2010
15 years 29 days ago
2010
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
132
click to vote
WG
2001
Springer
15 years 7 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
115
click to vote
DM
2008
15 years 2 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
108
click to vote
JGT
2007
15 years 2 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...