71 search results - page 1 / 15 » Characterizing path graphs by forbidden induced subgraphs |
32
Voted
CORR
2008
Springer
14 years 10 months ago
2008
Springer
WG
2010
Springer
14 years 8 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
SIAMDM
2008
14 years 10 months ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
DAM
2008
14 years 10 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
114
click to vote
JGT
2008
14 years 10 months ago
2008
: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...