Separated Matchings and Small Discrepancy Colorings

DOI10.1007/978-3-642-34191-5_23zbMath1375.68159OpenAlexW1438038385MaRDI QIDQ4899284

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)

Related Items (1)

Upper bounds for the necklace folding problems

Cites Work

• Long alternating paths in bicolored point sets
• Bipartite embeddings of trees in the plane
• Universal Sets for Straight-Line Embeddings of Bicolored Graphs
• Hamiltonian Alternating Paths on Bicolored Double-Chains
• Unnamed Item
• Unnamed Item

This page was built for publication: Separated Matchings and Small Discrepancy Colorings