Tutte sets in graphs. II: The complexity of finding maximum Tutte sets (Q2370435): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Hajo J. Broersma / rank | |||
Property / author | |||
Property / author: Nathan Kahl / rank | |||
Property / author | |||
Property / author: Aurora Morgana / rank | |||
Property / author | |||
Property / author: Edward F. Schmeichel / rank | |||
Property / author | |||
Property / author: Thomas M. Surowiec / rank | |||
Property / author | |||
Property / author: Hajo J. Broersma / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Nathan Kahl / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Aurora Morgana / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Edward F. Schmeichel / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Thomas M. Surowiec / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2012519220 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4439444 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Structuring the elementary components of graphs having a perfect internal matching. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tutte type theorems for graphs having a perfect internal matching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3615302 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tutte sets in graphs I: Maximal tutte sets and D-graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3258698 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Factorization of Linear Graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:35, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tutte sets in graphs. II: The complexity of finding maximum Tutte sets |
scientific article |
Statements
Tutte sets in graphs. II: The complexity of finding maximum Tutte sets (English)
0 references
26 June 2007
0 references
(perfect) matching
0 references
Tutte set
0 references
extreme set
0 references
deficiency
0 references
\(D\)-graph
0 references