Labelling Graphs with a Condition at Distance 2
From MaRDI portal
Publication:4030197
Recommendations
Cited in
(only showing first 100 items - show all)- Improved bounds on the chromatic numbers of the square of Kneser graphs
- L(p,2,1)-labeling of the infinite regular trees
- On Injective Colourings of Chordal Graphs
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
- On irreducible no-hole \(L(2,1)\)-coloring of subdivision of graphs
- \((2,1)\)-total labelling of outerplanar graphs
- \((p,1)\)-total labelling of graphs
- Radio number for trees
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs
- Online \(L(2,1)\)-coloring problem on paths with restricted size of memory
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes
- On irreducible no-hole \(L(2, 1)\)-labelings of hypercubes and triangular lattices
- The k-distance chromatic number of trees and cycles
- On \((d,1)\)-total numbers of graphs
- L(p,q)-labeling of a graph embeddable on the torus
- Locally injective k-colourings of planar graphs
- Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs
- On radio connection number of graphs
- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- \( L ( p , q )\)-labelings of subdivisions of graphs
- The \(L(2,1)\)-labeling on planar graphs
- Distance-constrained labeling of complete trees
- Injective coloring of planar graphs
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- Path covering number and \(L(2,1)\)-labeling number of graphs
- Some classes of trees with maximum number of holes two
- Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
- A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\)
- Distance three labellings for \(K _n\times K_2\)
- \(L(p,q)\)-labeling and integer tension of a graph embedded on torus
- The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
- \(L(2,1)\)-labelings on the composition of \(n\) graphs
- scientific article; zbMATH DE number 1420920 (Why is no real title available?)
- On the \(L(2, 1)\)-labelling of block graphs
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
- scientific article; zbMATH DE number 6940804 (Why is no real title available?)
- List backbone colouring of graphs
- \(L(d,1)\)-labelings of the edge-path-replacement by factorization of graphs
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- Good edge-labelling of graphs
- Labeling trees with a condition at distance two
- On island sequences of labelings with a condition at distance two
- Solutions of some L(2, 1)-coloring related open problems
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Graph labellings with variable weights, a survey
- Coloring the square of the Kneser graph \(\mathrm{KG}(2k+1,k)\) and the Schrijver graph \(\mathrm{SG}(2k+2,k)\)
- Graph covers: where topology meets computer science, and simple means difficult
- On irreducible no‐hole L(2, 1)‐coloring of trees
- \(L(4, 3, 2, 1)\)-path coloring of certain classes of graphs
- Determining the \(L(2,1)\)-span in polynomial space
- Infinitely many trees with maximum number of holes zero, one, and two
- Group path covering and \(L(j,k)\)-labelings of diameter two graphs
- L(2,1)-labelling of generalized prisms
- scientific article; zbMATH DE number 5036064 (Why is no real title available?)
- The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
- (2,1)-total labelling of trees with sparse vertices of maximum degree
- Radio and radial radio numbers of certain sunflower extended graphs
- Further results on the radio number of trees
- Labeling bipartite permutation graphs with a condition at distance two
- \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs
- An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
- A note on \(L (2, 1)\)-labelling of trees
- An O(n n) algorithm for finding edge span of cacti
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs
- On critical trees labeled with a condition at distance two
- \(K_n\square P\) is radio graceful
- L(1, 2)-edge-labelings for lattices
- On \(L(k, k - 1, \ldots, 1)\) labeling of triangular lattice
- Greedy \(F\)-colorings of graphs
- Acyclic, star, and injective colouring: bounding the diameter
- A new graph parameter and a construction of larger graph without increasing radio \(k\)-chromatic number
- Lambda number for the direct product of some family of graphs
- Distance-constrained labellings of Cartesian products of graphs
- Computing \(L(p, 1)\)-labeling with combined parameters
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees
- \((2,1)\)-Total number of trees with maximum degree three
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
- Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs
- Notes on \(L(1,1)\) and \(L(2,1)\) labelings for \(n\)-cube
- On the number of 2-packings in a connected graph
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
- Radio number of trees
- Optimal channel assignment and \(L(p,1)\)-labeling
- Pair \(L(2, 1)\)-labelings of infinite graphs
- On radio \(k\)-labeling of the power of the infinite path
- Labeling trees with a condition at distance two
- Radio labelings of distance graphs
- \(\lambda\)-coloring matrogenic graphs
- Hamiltonicity and circular distance two labellings
- A note on collections of graphs with non-surjective lambda labelings
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
- A new approach on locally checkable problems
- \(L(3,2,1)\)-labeling problems on trapezoid graphs
- On a distance-constrained graph labeling to model cooperation
- Some results on the injective chromatic number of graphs
- On \(L(d,1)\)-labeling of Cartesian product of a cycle and a path
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
- On \(L(2,1)\)-labellings of distance graphs
This page was built for publication: Labelling Graphs with a Condition at Distance 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030197)
