Perfect matchings in hexagonal systems (Q5896369): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Horst Sachs / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q105944603 / rank
 
Normal rank
Property / author
 
Property / author: Horst Sachs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02579161 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005113023 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:26, 30 July 2024

scientific article; zbMATH DE number 3861208
Language Label Description Also known as
English
Perfect matchings in hexagonal systems
scientific article; zbMATH DE number 3861208

    Statements

    Perfect matchings in hexagonal systems (English)
    0 references
    0 references
    1984
    0 references
    A hexagonal system (HS) is a finite connected plane graph with no cut- vertices in which every interior region is a hexagonal unit cell. The author provides a simple and fast algorithm for finding a perfect matching (PM) in an HS if it exists. He also characterizes the set of all PM's in a given HS. The results do have applications in chemistry, since an HS with a PM represents a certain molecule.
    0 references
    0 references
    0 references
    0 references
    0 references
    honeycomb system
    0 references
    hexagonal animal
    0 references
    plane graph
    0 references
    perfect matching
    0 references
    hexagonal system
    0 references
    0 references
    0 references
    0 references