Systems of distant representatives

DOI10.1016/J.DAM.2004.02.018MaRDI QIDQ1764814zbMATH OpenOpenAlexFDO

Authors Jiří Fiala, Jan Kratochvíl, Andrzej Proskurowski

Publication date 22 February 2005

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2004.02.018

zbMATH Keywords

Metric spaceIndependent setGraph labelingsSystems of representatives

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Metric spaces, metrizability (54E35)

Recommendations

• scientific article; zbMATH DE number 1974112
• Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
• Systems of pairs of \(q\)-distant representatives, and graph colorings
• Systems of distant representatives in euclidean space

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1263991 (Why is no real title available?)
• scientific article; zbMATH DE number 1033812 (Why is no real title available?)
• scientific article; zbMATH DE number 1974112 (Why is no real title available?)
• scientific article; zbMATH DE number 2044507 (Why is no real title available?)
• scientific article; zbMATH DE number 881282 (Why is no real title available?)
• scientific article; zbMATH DE number 1409224 (Why is no real title available?)
• scientific article; zbMATH DE number 6472588 (Why is no real title available?)
• A special planar satisfiability problem and a consequence of its NP- completeness
• An upper bound on the number of cliques in a graph
• Complement reducible graphs
• Fixed-parameter complexity of \(\lambda\)-labelings
• Graph labeling and radio channel assignment
• Hall's theorem for hypergraphs
• Labelling Graphs with a Condition at Distance 2
• On Representatives of Subsets
• Paths, Trees, and Flowers
• Precoloring Extension III: Classes of Perfect Graphs
• Systems of pairs of \(q\)-distant representatives, and graph colorings
• The $L(2,1)$-Labeling Problem on Graphs
• The clique complex and hypergraph matching
• Transversals of Vertex Partitions in Graphs

Cited in

(25)

• Approximating Largest Convex Hulls for Imprecise Points
• Systems of distant representatives in Euclidean space
• Away from each other
• Threshold-coloring and unit-cube contact representation of planar graphs
• The dispersive art gallery problem
• Point set distance and orthogonal range problems with dependent geometric uncertainties
• Computing largest minimum color-spanning intervals of imprecise points
• On minimum- and maximum-weight minimum spanning trees with neighborhoods
• Uniformity of point samples in metric spaces using gap ratio
• Approximating largest convex hulls for imprecise points
• Uniformity of point samples in metric spaces using gap ratio
• Systems of pairs of \(q\)-distant representatives, and graph colorings
• Minimizing the diameter of a spanning tree for imprecise points
• Distance Constrained Labelings of Trees
• Dispersion in disks
• A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
• Largest and smallest convex hulls for imprecise points
• scientific article; zbMATH DE number 1974112 (Why is no real title available?)
• Data imprecision under \(\lambda\)-geometry model
• Constrained \(k\)-center and movement to independence
• scientific article; zbMATH DE number 1567877 (Why is no real title available?)
• Minimum color spanning circle in imprecise setup
• Largest bounding box, smallest diameter, and related problems on imprecise points
• Minimum color spanning circle of imprecise points
• Systems of distant representatives in euclidean space

This page was built for publication: Systems of distant representatives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1764814)