Labelling Graphs with a Condition at Distance 2
From MaRDI portal
Publication:4030197
DOI10.1137/0405048zbMATH Open0767.05080OpenAlexW2148410650MaRDI QIDQ4030197FDOQ4030197
Authors: J. Griggs, Roger K. Yeh 
Publication date: 1 April 1993
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/75e521e85a766384590b767ad9779dfc13201753
Recommendations
graph coloringNP-completenesscycleHamilton pathslabelling graphschannel assignmentslabelling numbers
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (only showing first 100 items - show all)
- The \(L(2,1)\)-labeling on Cartesian sum of graphs
- Title not available (Why is that?)
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks
- On island sequences of labelings with a condition at distance two
- Title not available (Why is that?)
- 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
- \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs
- On \(n\)-fold \(L(j,k)\)-and circular \(L(j,k)\)-labelings of graphs
- On \(L(2,1)\)-labellings of distance graphs
- \(\lambda\)-coloring matrogenic graphs
- A note on collections of graphs with non-surjective lambda labelings
- Labeling the \(r\)-path with a condition at distance two
- Minimum 2-distance coloring of planar graphs and channel assignment
- \(L(h,k)\)-labelings of Hamming graphs
- Labeling graphs with two distance constraints
- On distance two labelling of unit interval graphs
- On \(\text{Ł}(\wp, \wp - 1, \dots, 1)\) labelings of circulant graphs
- Improved lower bounds for the radio number of trees
- Optimal radio labellings of block graphs and line graphs of trees
- Distance-two labelings of digraphs
- \(L(2, 1)\)-labeling of circulant graphs
- On the hole index of \(L(2,1)\)-labelings of \(r\)-regular graphs
- Lower bounds for the graph homomorphism problem
- Linear and cyclic distance-three labellings of trees
- The \(L(p, q)\)-labelling of planar graphs without 4-cycles
- \(L(p, q)\)-labeling of planar graphs with small girth
- \(L(3,1)\)-labeling of circulant graphs
- The List \(L(2, 1)\)-labeling of planar graphs
- Labelling planar graphs without 4-cycles with a condition on distance two
- Distance constrained labelings of planar graphs with no short cycles
- Distance-two labellings of Hamming graphs
- \(L(0,1)\)-labelling of permutation graphs
- A complete \(L (2, 1)\) span characterization for small trees
- Injective colorings with arithmetic constraints
- Frequency assignment problem in networks with limited spectrum
- Distance-two labelings of graphs
- Acyclic colorings of products of trees
- Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
- \(L(p,q)\)-label coloring problem with application to channel allocation
- Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
- A channel assignment problem for optical networks modelled by Cayley graphs
- \(L(2,1)\)-labelings of some families of oriented planar graphs
- \(L(2,1)\)-labeling of oriented planar graphs
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
- New results in \(t\)-tone coloring of graphs
- On real number labelings and graph invertibility
- Radio \(k\)-chromatic number of cycles for large \(k\)
- Labelling of some planar graphs with a condition at distance two
- On \(L (p, q)\)-labelling of planar graphs without cycles of length four
- Title not available (Why is that?)
- List version of \(L(d,s)\)-labelings
- On the \(L\)(2,~1)-labeling conjecture for brick product graphs
- On irreducible no-hole \(L(2, 1)\)-labelings of hypercubes and triangular lattices
- \(L(p,q)\)-labeling of a graph embeddable on the torus
- Locally injective \(k\)-colourings of planar graphs
- \( L ( p , q )\)-labelings of subdivisions 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
- Path covering number and \(L(2,1)\)-labeling number of graphs
- On \(L(2,1)\)-coloring split, chordal bipartite, and weakly chordal graphs
- On the \(L(2, 1)\)-labelling of block graphs
- Distance three labellings for \(K _n\times K_2\)
- A note on the \(L (2, 1)\)-labelling problem of \(\mathcal{G} (k, m)\)
- On \(L(2,1)\)-labeling of generalized Petersen graphs
- \(L(2, 1)\)-labeling of permutation and bipartite permutation graphs
- Graph labellings with variable weights, a survey
- An 8-approximation algorithm for \(L(2 ,1)\)-labeling of unit disk graphs
- Group path covering and \(L(j,k)\)-labelings of diameter two graphs
- \(L(2,1)\)-labelling of generalized prisms
- Labeling bipartite permutation graphs with a condition at distance two
- \(L(1, 2)\)-edge-labelings for lattices
- On critical trees labeled with a condition at distance two
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees
- Labeling trees with a condition at distance two
- \((2,1)\)-Total number of trees with maximum degree three
- On the number of 2-packings in a connected graph
- Hamiltonicity and circular distance two labellings
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable
- An O\((n^{1.75})\) algorithm for \(L(2,1)\)-labeling of trees
- A linear time algorithm for \(L(2,1)\)-labeling of trees
- Extremal problems on consecutive \(L(2,1)\)-labelling
- An extremal problem on non-full colorable graphs
- \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
- L(2, 1)-labellings for direct products of a triangle and a cycle
- \(L(2,1)\)-labeling of perfect elimination bipartite graphs
- \(L(h, k)\)-labelling for octagonal grid
- Improved bounds on the span of \(L(1,2)\)-edge labeling of some infinite regular grids
- On \((p,1)\)-total labelling of planar graphs
- On the universality and extremality of graphs with a distance constrained colouring
- The game \(L(d,1)\)-labeling problem of graphs
- Group path covering and distance two labeling of graphs
- An $\mbox{O}(n^{1.75})$ Algorithm for L(2,1)-Labeling of Trees
- \((2,1)\)-total labeling of trees with large maximum degree
- \(L(2,1)\)-labelings of subdivisions of graphs
- Characterization results for the \(L(2, 1, 1)\)-labeling problem on trees
- The minimum span of \(L(2,1)\)-labelings of certain generalized Petersen graphs
- The minimum span of \(L(2,1)\)-labelings of generalized flowers
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)
