scientific article; zbMATH DE number 1420920

zbMATH Open0943.05072MaRDI QIDQ4944992FDOQ4944992

Authors: Jiří Fiala, Ton Kloks, Jan Kratochvíl 

Publication date: 7 June 2000

Title of this publication is not available (Why is that?)

Recommendations

• Fixed-parameter complexity of \(\lambda\)-labelings
• Labelling Graphs with a Condition at Distance 2
• \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
• \(L(2,1,1)\)-labeling is NP-complete for trees
• Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)

zbMATH Keywords

labelingcomplexitysparse graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (24)

• The \(L(2,1)\)-labeling on Cartesian sum of graphs
• Irreducibility of L(2, 1)-coloring and Inh-Colorability of Some Classes of Graphs
• The \(L(2,1)\)-labeling on planar graphs
• Improved upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs
• The \(L(2,1)\)-labeling of \(K_{1,n}\)-free graphs and its applications
• \(L(2,1)\)-labelings on the composition of \(n\) graphs
• Labelings of Graphs with Fixed and Variable Edge-Weights
• The \(L(2,1)\)-labeling on the skew and converse skew products of graphs
• Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs
• \(\lambda\)-coloring matrogenic graphs
• Graph labelings and complexity problems: a review
• The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
• Theoretical Computer Science
• The \(L(2,1)\)-labeling on graphs and the frequency assignment problem
• Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
• Title not available (Why is that?)
• On distance constrained labeling of disk graphs
• \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s
• A survey on labeling graphs with a condition at distance two
• Computing L(p,1)-Labeling with Combined Parameters
• Fixed-parameter complexity of \(\lambda\)-labelings
• Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
• Title not available (Why is that?)
• The \(L(2,1)\)-labeling of unigraphs

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 Q4944992)