The Merrifield–Simmons Conjecture Holds for Bipartite Graphs (Q4916104): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.21656 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3123287700 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123243155 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1006.4253 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1002/JGT.21656 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:22, 30 December 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
    0 references
    19 April 2013
    0 references
    independent sets
    0 references
    Merrifield-Simmons conjecture
    0 references

    Identifiers