On the global forcing number of hexagonal systems (Q741758): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2856681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global forcing number of benzenoid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for perfect matching in hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in hexagonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The global forcing number of the parallelogram polyhex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4664109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When each hexagon of a hexagonal system covers it / rank
 
Normal rank

Latest revision as of 01:47, 9 July 2024

scientific article
Language Label Description Also known as
English
On the global forcing number of hexagonal systems
scientific article

    Statements

    On the global forcing number of hexagonal systems (English)
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    global forcing number
    0 references
    perfect matching
    0 references
    hexagonal system
    0 references
    divisible hexagonal system
    0 references

    Identifiers