Counting paths, cycles, and blow‐ups in planar graphs (Q6057641): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3122201561 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3680852 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum number of paths of length four in a planar graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Foundations of Optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the number of cycles of lengthk in a maximal planar graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Subgraph densities in a surface / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:54, 3 August 2024
scientific article; zbMATH DE number 7746112
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting paths, cycles, and blow‐ups in planar graphs |
scientific article; zbMATH DE number 7746112 |
Statements
Counting paths, cycles, and blow‐ups in planar graphs (English)
0 references
5 October 2023
0 references
extremal graph theory
0 references
planar graphs
0 references
weighted graphs
0 references
