2283 search results - page 7 / 457 » Bounds of Graph Characteristics |
JGT
2006
13 years 7 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Constructing some regular graph with a given girth, a given degree and the fewest possible vertices is a hard problem. This problem is called the cage graph problem and has some l...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
STOC
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
SIAMDM
2008
13 years 7 months ago
2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...