2011
DOI: 10.1016/j.endm.2011.09.053
|View full text |Cite
|
Sign up to set email alerts
|

Partitioning Chordal Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2014
2014

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…On the other hand, when is near m (recall that k has to be at least two for the matrix to contain M 1 or M 2 ), the number of matrices with infinitely many chordal minimal obstructions is of the order of T 1− k, . For comparison, matrices with finitely many chordal minimal obstruc-tions include all matrices without * [10] or without 1 [14] or without 0 [14], so there are at least 3 · 2 ( m 2 ) such matrices for any k, . We do not know whether there are more matrices with finitely or with infinitely many chordal minimal obstructions.…”
Section: Large Matricesmentioning
confidence: 99%
“…On the other hand, when is near m (recall that k has to be at least two for the matrix to contain M 1 or M 2 ), the number of matrices with infinitely many chordal minimal obstructions is of the order of T 1− k, . For comparison, matrices with finitely many chordal minimal obstruc-tions include all matrices without * [10] or without 1 [14] or without 0 [14], so there are at least 3 · 2 ( m 2 ) such matrices for any k, . We do not know whether there are more matrices with finitely or with infinitely many chordal minimal obstructions.…”
Section: Large Matricesmentioning
confidence: 99%