The Merrifield–Simmons Conjecture Holds for Bipartite Graphs (Q4916104): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3988150 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3043192 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Clique polynomials and independent set polynomials of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5284637 / rank | |||
Normal rank | |||
Revision as of 09:45, 6 July 2024
scientific article; zbMATH DE number 6155916
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Merrifield–Simmons Conjecture Holds for Bipartite Graphs |
scientific article; zbMATH DE number 6155916 |
Statements
The Merrifield–Simmons Conjecture Holds for Bipartite Graphs (English)
0 references
19 April 2013
0 references
independent sets
0 references
Merrifield-Simmons conjecture
0 references
