New bounds on maximal linkless graphs (Q6148480): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.2140/agt.2023.23.2545 / rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3044911025 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of edges in maximally linkless graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Knots and links in spatial graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-separating planar graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4250144 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Homomorphiesätze für Graphen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A splitter for graphs with no Petersen family minor / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linkless embeddings of graphs in 3-space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4273838 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3684140 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.2140/AGT.2023.23.2545 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:54, 30 December 2024
scientific article; zbMATH DE number 7786940
Language | Label | Description | Also known as |
---|---|---|---|
English | New bounds on maximal linkless graphs |
scientific article; zbMATH DE number 7786940 |
Statements
New bounds on maximal linkless graphs (English)
0 references
11 January 2024
0 references
maximal linkless graphs
0 references
clique sums
0 references
0 references