scientific article; zbMATH DE number 1759423
From MaRDI portal
Publication:4536372
Recommendations
Cited in
(20)- \(k-L(2,1)\)-labelling for planar graphs is NP-complete for \(k\geq 4\)
- scientific article; zbMATH DE number 1819633 (Why is no real title available?)
- scientific article; zbMATH DE number 1953096 (Why is no real title available?)
- scientific article; zbMATH DE number 1929928 (Why is no real title available?)
- Experimental and Efficient Algorithms
- Graph labellings with variable weights, a survey
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
- Approximations for -Colorings of Graphs
- Optimal radiocoloring of trees
- scientific article; zbMATH DE number 2123365 (Why is no real title available?)
- scientific article; zbMATH DE number 1953160 (Why is no real title available?)
- Algorithms for graphs with small octopus
- Distance constrained labelings of planar graphs with no short cycles
- scientific article; zbMATH DE number 2170479 (Why is no real title available?)
- Systems of pairs of \(q\)-distant representatives, and graph colorings
- Distance constrained labelings of \(K_{4}\)-minor free graphs
- scientific article; zbMATH DE number 1862255 (Why is no real title available?)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations
- Radiocoloring in planar graphs: Complexity and approximations
- Labeling planar graphs with a condition at distance two
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 Q4536372)
