scientific article; zbMATH DE number 881282
From MaRDI portal
Publication:4879166
DOI10.1002/(SICI)1097-0118(199605)22:1%3C47::AID-JGT7%3E3.0.CO;2-LzbMATH Open0848.05056MaRDI QIDQ4879166FDOQ4879166
Publication date: 7 October 1996
Title of this publication is not available (Why is that?)
Recommendations
Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (32)
- Radio number for trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Labeling trees with a condition at distance two
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- List backbone colouring of graphs
- On island sequences of labelings with a condition at distance two
- On critical trees labeled with a condition at distance two
- Greedy \(F\)-colorings of graphs
- Labeling trees with a condition at distance two.
- Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs
- A note on collections of graphs with non-surjective lambda labelings
- On a distance-constrained graph labeling to model cooperation
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- No-hole \(L(2,1)\)-colorings
- Distance-two labelings of digraphs
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- On the universality and extremality of graphs with a distance constrained colouring
- Theory of computational complexity. Part 7. Transl. from the Russian
- \(L(2,1)\)-labeling of direct product of paths and cycles
- Online coloring of disk graphs
- Distance-two labelings of graphs
- On distance constrained labeling of disk graphs
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- A survey on labeling graphs with a condition at distance two
- Fixed-parameter complexity of \(\lambda\)-labelings
- A bound on the chromatic number of the square of a planar graph
- Title not available (Why is that?)
- Systems of distant representatives
- Backbone coloring for graphs with large girths
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879166)
