Distance-related invariants on polygraphs
From MaRDI portal
Publication:1377616
DOI10.1016/S0166-218X(97)00069-3zbMath0886.05058OpenAlexW2088887891WikidataQ128109455 ScholiaQ128109455MaRDI QIDQ1377616
Bojan Mohar, Janez Žerovnik, Martin Juvan
Publication date: 8 April 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs, Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers, Generic algorithms for some decision problems on fasciagraphs and rotagraphs, The obnoxious center problem on weighted cactus graphs., \(L(2,1)\)-labeling of direct product of paths and cycles
Cites Work