Extremal threshold graphs for matchings and independent sets (Q1756116): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Graphs with maximal number of adjacent pairs of edges / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extremal problems for independent set enumeration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4071752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with the fewest matchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5726070 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Threshold graphs and related topics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4261184 / rank | |||
Normal rank |
Revision as of 20:06, 17 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extremal threshold graphs for matchings and independent sets |
scientific article |
Statements
Extremal threshold graphs for matchings and independent sets (English)
0 references
11 January 2019
0 references
threshold graphs
0 references
independent sets
0 references
matchings
0 references
almost alternating graphs
0 references
extremal graph theory
0 references