Limit points for average genus. I: 3-connected and 2-connected simplicial graphs (Q921011): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Jian'er Chen / rank | |||
Property / reviewed by | |||
Property / reviewed by: Jinhai Chen / rank | |||
Property / author | |||
Property / author: Jian'er Chen / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Jinhai Chen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Kuratowski-type theorems for average genus / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Limit points for average genus. II: 2-connected non-simplicial graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Genus distributions for two classes of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4040797 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hierarchy for imbedding-distribution invariants of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the average genus of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Genus distributions for bouquets of circles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3757929 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3313879 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Region distributions of graph embeddings and Stirling numbers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The graph genus problem is NP-complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3344220 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:21, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Limit points for average genus. I: 3-connected and 2-connected simplicial graphs |
scientific article |
Statements
Limit points for average genus. I: 3-connected and 2-connected simplicial graphs (English)
0 references
1992
0 references
It is demonstrated that a given value of average genus is shared by at most finitely many 2-connected simplicial graphs and by at most finitely many 3-connected graphs. Moreover, the distribution of values of average genus is sparse, in the following sense: within any finite real interval, there are at most finitely many different numbers that are values of average genus for 2-connected simplicial graphs or for 3-connected graphs. Thus, there are no limit points for the values of average genus of graphs in these classes. The potential applicability of these results to graph isomorphism testing is considered.
0 references
graph imbedding
0 references
average genus
0 references
graph isomorphism testing
0 references