×

Found 182 Documents (Results 1–100)

Tight bounds for counting colorings and connected edge sets parameterized by cutwidth. (English) Zbl 07836603

Berenbrink, Petra (ed.) et al., 39th international symposium on theoretical aspects of computer science, STACS 2022, Marseille, France, virtual conference, March 15–18, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 219, Article 36, 20 p. (2022).
MSC:  68Qxx

On synchronizing colorings and the eigenvectors of digraphs. (English) Zbl 1398.05092

Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 48, 14 p. (2016).
MSC:  05C20 05C15 05C50
Full Text: DOI

Edge-colorings avoiding fixed rainbow stars. (English) Zbl 1347.05067

Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 275-280, electronic only (2015).
MSC:  05C15 05C35
Full Text: DOI

A rainbow Erdős-Rothschild problem. (English) Zbl 1346.05072

Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 473-480, electronic only (2015).
MSC:  05C15 05C35
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software