Printer Friendly

Articles from Discrete Mathematics and Theoretical Computer Science (January 1, 2010)

1-8 out of 8 article(s)
Title Author Type Words
Acyclic colourings of graphs with bounded degree. Borowiecki, Mieczyslaw; Jesse-Jozefczyk, Katarzyna; Fiedorowicz, Anna; Sidorowicz, Elzbieta Report 7380
An improved bound on the largest induced forests for triangle-free planar graphs. Kowalik, Lukasz; Luzar, Borut; Skrekovski, Riste Report 9141
Deciding whether the ordering is necessary in a Presburger formula. Choffrut, Christian; Frigeri, Achille Report 9293
Edge-removal and non-crossing configurations in geometric graphs. Aichholzer, Oswin; Flores-Penaloza, David; Hurtado, Ferran; Cabello, Sergio; Hackl, Thomas; Fabila-M Report 5927
On a 1,2 conjecture. Przybylo, Jakub; Wozniak, Mariusz Report 5241
On edge-intersection graphs of k-bend paths in grids. Biedl, Therese; Stern, Michal Report 6103
Symmetric monochromatic subsets in colorings of the Lobachevsky plane. Banakh, Taras; Dudko, Artem; Repovs, Dusan Report 4735
Tight bounds for delay-sensitive aggregation. Pignolet, Yvonne Anne; Schmid, Stefan; Wattenhofer, Roger Report 10696

Terms of use | Privacy policy | Copyright © 2020 Farlex, Inc. | Feedback | For webmasters