On magic labellings of -prisms
Martin Bača (1990)
Mathematica Slovaca
Similarity:
Displaying similar documents to “NP-completeness of the planar separator problems.”
On magic labellings of -prisms
A factor-two approximation algorithm for two-dimensional phase unwrapping.
Bar-Yehuda, Reuven, Yavneh, Irad (2006)
Journal of Graph Algorithms and Applications
Similarity:
On magic labellings of type for three classes of plane graphs
Martin Bača (1989)
Mathematica Slovaca
Similarity:
Irregularity strength of regular graphs.
Przybylo, Jakub (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A weighted graph polynomial from chromatic invariants of knots
Steven D. Noble, Dominic J. A. Welsh (1999)
Annales de l'institut Fourier
Similarity:
Motivated by the work of Chmutov, Duzhin and Lando on Vassiliev invariants, we define a polynomial on weighted graphs which contains as specialisations the weighted chromatic invariants but also contains many other classical invariants including the Tutte and matching polynomials. It also gives the symmetric function generalisation of the chromatic polynomial introduced by Stanley. We study its complexity and prove hardness results for very restricted classes of graphs.
Two heuristics for the absolute -center problem in graphs
Ján Plesník (1988)
Mathematica Slovaca
Similarity: