Separated matchings and small discrepancy colorings

DOI10.1007/978-3-642-34191-5_23MaRDI QIDQ4899284zbMATH OpenOpenAlexFDO

Authors Viola Mészáros

Publication date 7 January 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34191-5_23

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An upper bound on the size of separated matchings
• Matching colored points in the plane: Some new results
• On a matching problem in the plane
• An optimal algorithm for plane matchings in multipartite geometric graphs
• Graph Drawing

Cites work

• An upper bound on the size of separated matchings
• Bipartite embeddings of trees in the plane
• Hamiltonian Alternating Paths on Bicolored Double-Chains
• scientific article; zbMATH DE number 2209732 (Why is no real title available?)
• Long alternating paths in bicolored point sets
• Universal sets for straight-line embeddings of bicolored graphs

Cited in

(2)

• Upper bounds for the necklace folding problems
• An upper bound on the size of separated matchings

This page was built for publication: Separated matchings and small discrepancy colorings

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