1163 search results - page 30 / 233 » Embedding into Bipartite Graphs |
113
Voted
IPL
2002
15 years 3 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
127
click to vote
JCT
2010
15 years 2 months ago
2010
We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε...
123
click to vote
DM
1998
15 years 3 months ago
1998
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
146
Voted
DM
2007
15 years 3 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
113
Voted
WG
2009
Springer
15 years 10 months ago
2009
Springer
