Graph coloring, communication complexity and the stubborn problem (Invited Talk)

Bousquet, Nicolas; Lagoutte, Aurélie; Stéphan, Thomassé

doi:10.4230/LIPIcs.STACS.2013.3

Document

Graph coloring, communication complexity and the stubborn problem (Invited Talk)

Authors Nicolas Bousquet, Aurélie Lagoutte, Thomassé Stéphan

Part of: Volume: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Symposium on Theoretical Aspects of Computer Science (STACS)
License: Creative Commons Attribution-NoDerivs 3.0 Unported license
Publication Date: 2013-02-26

PDF

File

PDF

LIPIcs.STACS.2013.3.pdf

Filesize: 389 kB
2 pages

Document Identifiers

DOI: 10.4230/LIPIcs.STACS.2013.3
URN: urn:nbn:de:0030-drops-39158

Subject Classification

Keywords

stubborn problem
graph coloring
Clique-Stable set separation
Alon-Saks-Seymour conjecture
bipartite packing

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

We discuss three equivalent forms of the same problem arising in communication complexity, constraint satisfaction problems, and graph coloring. Some partial results are discussed.

Cite As Get BibTex

Nicolas Bousquet, Aurélie Lagoutte, and Thomassé Stéphan. Graph coloring, communication complexity and the stubborn problem (Invited Talk). In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 3-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013) https://doi.org/10.4230/LIPIcs.STACS.2013.3

Author Details

Nicolas Bousquet

Aurélie Lagoutte

Thomassé Stéphan

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail