Global forcing number of benzenoid graphs (Q2644398): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the forced matching numbers of bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3813828 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On lower bounds of number of perfect matchings in fullerene graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Perfect matchings in bipartite lattice animals: lower bounds and realizability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Forcing matchings on square grids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The minimum forcing number for the torus and hypercube / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hexagonal systems with forcing edges / rank | |||
Normal rank |
Latest revision as of 14:30, 26 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Global forcing number of benzenoid graphs |
scientific article |
Statements
Global forcing number of benzenoid graphs (English)
0 references
31 August 2007
0 references
global forcing number
0 references
benzenoid graph
0 references
perfect matching
0 references