A two-connected planar graph without concurrent longest paths (Q2554342): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5537559 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Hamiltonian Circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Über die Nichtexistenz zweier Knotenpunkte eines Graphen, die alle längsten Kreise fassen / rank | |||
Normal rank | |||
Latest revision as of 11:33, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A two-connected planar graph without concurrent longest paths |
scientific article |
Statements
A two-connected planar graph without concurrent longest paths (English)
0 references
1972
0 references
0 references
