553 search results - page 1 / 111 » Cover Contact Graphs |
GD
2007
Springer
14 years 2 months ago
2007
Springer
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
DAM
2006
13 years 10 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
EJC
2008
13 years 11 months ago
2008
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon and apply it to show that the minimal common cover of two graphs need not be uniqu...
WG
2007
Springer
14 years 4 months ago
2007
Springer
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...