Sciweavers

2 search results - page 1 / 1
» On Listing, Sampling, and Counting the Chordal Graphs with E...
Sort
View
COCOON
2008
Springer
13 years 8 months ago
On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Take...
COCOON
2009
Springer
14 years 1 months ago
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
Pinar Heggernes, Federico Mancini, Charis Papadopo...