scientific article; zbMATH DE number 881282
From MaRDI portal
Publication:4879166
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199605)22:1<47::AID-JGT7>3.0.CO;2-L" /><47::AID-JGT7>3.0.CO;2-L 10.1002/(SICI)1097-0118(199605)22:1<47::AID-JGT7>3.0.CO;2-LzbMath0848.05056MaRDI QIDQ4879166
John P. Georges, David W. Mauro
Publication date: 7 October 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45)
Related Items (26)
Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs ⋮ Distance-two labelings of digraphs ⋮ Backbone coloring for graphs with large girths ⋮ On the universality and extremality of graphs with a distance constrained colouring ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ No-hole \(L(2,1)\)-colorings ⋮ Greedy \(F\)-colorings of graphs ⋮ List backbone colouring of graphs ⋮ Radio number for trees ⋮ On a distance-constrained graph labeling to model cooperation ⋮ A bound on the chromatic number of the square of a planar graph ⋮ Systems of distant representatives ⋮ \(L(2,1)\)-labeling of direct product of paths and cycles ⋮ A note on collections of graphs with non-surjective lambda labelings ⋮ On distance constrained labeling of disk graphs ⋮ \(L(2,1)\)-labelings of Cartesian products of two cycles ⋮ On critical trees labeled with a condition at distance two ⋮ A survey on labeling graphs with a condition at distance two ⋮ Fixed-parameter complexity of \(\lambda\)-labelings ⋮ Theory of computational complexity. Part 7. Transl. from the Russian ⋮ The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications ⋮ On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path ⋮ Labeling trees with a condition at distance two ⋮ On \(L(2,1)\)-labelings of Cartesian products of paths and cycles ⋮ Systems of pairs of \(q\)-distant representatives, and graph colorings ⋮ Distance-two labelings of graphs
This page was built for publication:
