Tutte type theorems for graphs having a perfect internal matching (Q2390326): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A structure theorem for maximum internal matchings in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4864783 / 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: Soliton automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matching theory / rank | |||
Normal rank | |||
Latest revision as of 20:02, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tutte type theorems for graphs having a perfect internal matching |
scientific article |
Statements
Tutte type theorems for graphs having a perfect internal matching (English)
0 references
21 July 2009
0 references
combinatorial problems
0 references
graph matchings
0 references
factor-critical graphs
0 references
