Enumerative properties of rooted circuit maps (Q604989): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/s00373-010-0937-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2123754314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-connected spanning subgraphs of planar 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Methods in Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Face sizes of 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submaps of maps. I: General 0-1 laws / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the asymptotic behaviour of maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Enumeration of Rooted Non-Separable Planar Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singularity Analysis of Generating Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2‐connected coverings of bounded degree in 3‐connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-walks in circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming and circumference of 3-connected graphs of low genus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The enumeration of c-nets via quadrangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-trees with few vertices of degree 3 in circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all maps are asymmetric / rank
 
Normal rank

Latest revision as of 10:54, 3 July 2024

scientific article
Language Label Description Also known as
English
Enumerative properties of rooted circuit maps
scientific article

    Statements

    Identifiers