21 search results - page 3 / 5 » A note on degree-constrained subgraphs |
ARSCOM
2008
14 years 9 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
65
Voted
DM
2006
14 years 9 months ago
2006
A graph is called biclaw-free if it has no biclaw as an induced subgraph. In this note, we prove that if G is a connected bipartite biclaw-free graph with (G) 5, then G is collap...
DMGT
2011
14 years 1 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
CPC
2004
14 years 9 months ago
2004
This note presents two results on real zeros of chromatic polynomials. The first result states that if G is a graph containing a q-tree as a spanning subgraph, then the chromatic ...
COMBINATORICS
2006
14 years 9 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...