A two-connected planar graph without concurrent longest paths (Q2554342): Difference between revisions
From MaRDI portal
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.1016/0095-8956(72)90048-2 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2021292985 / rank | |||
Normal rank | |||
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