Nice pairs of disjoint pentagons in fullerene graphs (Q830887): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10910-021-01242-6 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10910-021-01242-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3137529278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfect matching polytope and solid bricks / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to build a brick / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some structural properties of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclical edge-connectivity of fullerene graphs and \((k,6)\)-cages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nice pairs of odd cycles in fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-Resonance of Fullerenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fullerene graphs have exponentially many perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic 7-edge-cuts in fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic edge-cuts in fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cyclic edge-connectivity of fullerenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isolated-pentagon rule and nice substructures in fullerenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the cyclical edge-connectivity of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-resonant fullerenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the anti-forcing number of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On<i>k</i>-Resonant Fullerene Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal fullerene graphs with the maximum Clar number / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-resonance of open-ended carbon nanotubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the Clar number of fullerene graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bound on the number of perfect matchings in fullerene graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10910-021-01242-6 / rank
 
Normal rank

Latest revision as of 04:28, 10 December 2024

scientific article
Language Label Description Also known as
English
Nice pairs of disjoint pentagons in fullerene graphs
scientific article

    Statements

    Nice pairs of disjoint pentagons in fullerene graphs (English)
    0 references
    0 references
    10 May 2021
    0 references
    fullerene graph
    0 references
    perfect matching
    0 references
    nice subgraph
    0 references
    disjoint pentagons
    0 references
    Birkhoff-von Neumann graph
    0 references

    Identifiers