Distance two surjective labelling of paths and interval graphs
From MaRDI portal
Publication:2045355
Recommendations
Cites work
- scientific article; zbMATH DE number 1185300 (Why is no real title available?)
- A Theorem about the Channel Assignment Problem
- A bound on the chromatic number of the square of a planar graph
- A mathematical approach on representation of competitions: competition cluster hypergraphs
- Approximations for -Colorings of Graphs
- Coloring the square of a planar graph
- Computation of certain topological coindices of graphene sheet and \(C_4C_8(S)\) nanotubes and nanotorus
- Degree sequence of graph operator for some standard graphs
- Labelling Graphs with a Condition at Distance 2
- On classes of infinite loaded graphs with randomly deleted edges
- On graphs with equal dominating and c-dominating energy
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- On the \(L(p,1)\)-labelling of graphs
- The $L(2,1)$-Labeling Problem on Graphs
- The \(L(3,2,1)\)-labeling problem on graphs
- L(0,1)-labelling of permutation graphs
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- L(2,1)-labeling of interval graphs
- \(L(3, 2, 1)\)- and \(L(4, 3, 2, 1)\)-labeling problems on interval graphs
- \(L(3,2,1)\)-labeling of graphs
Cited in
(3)
This page was built for publication: Distance two surjective labelling of paths and interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045355)