Generalizing \(D\)-graphs (Q2462386): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Tutte sets in graphs. II: The complexity of finding maximum Tutte sets / 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: Q4398864 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The extreme set condition of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4869540 / rank | |||
Normal rank |
Revision as of 12:44, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generalizing \(D\)-graphs |
scientific article |
Statements
Generalizing \(D\)-graphs (English)
0 references
30 November 2007
0 references
matching
0 references
\(D\)-graph
0 references
tutte set
0 references
barrier set
0 references
extreme set
0 references