Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-CyclesDvoráak, Zdeneák ; Lidicky, BernardSIAM journal on discrete mathematics, 2014-01, Vol.28 (1), p.521-552 [Periódico revisado por pares]Philadelphia: Society for Industrial and Applied MathematicsSem texto completo |
|
2 |
Material Type: Artigo
|
5-COLORING GRAPHS WITH 4 CROSSINGSERMIAN, Rok ; HAVET, Frédéric ; LIDICKY, Bernard ; PANGRAC, OndrejSIAM journal on discrete mathematics, 2011, Vol.25 (1-2), p.401-422 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
|
3 |
Material Type: Artigo
|
6-Critical Graphs on the Klein BottleKawarabayashi, Ken-ichi ; Král', Daniel ; Kynčl, Jan ; Lidický, BernardSIAM journal on discrete mathematics, 2009-01, Vol.23 (1), p.372-383 [Periódico revisado por pares]Philadelphia: Society for Industrial and Applied MathematicsTexto completo disponível |
|
4 |
Material Type: Artigo
|
Decomposing Graphs into Edges and TrianglesKRÁL', DANIEL ; LIDICKÝ, BERNARD ; MARTINS, TAÍSA L. ; PEHOVA, YANITSACombinatorics, probability & computing, 2019-05, Vol.28 (3), p.465-472 [Periódico revisado por pares]Cambridge, UK: Cambridge University PressTexto completo disponível |
|
5 |
Material Type: Artigo
|
Finding vertex-surjective graph homomorphismsGOLOVACH, Petr A ; LIDICKY, Bernard ; MARTIN, Barnaby ; PAULUSMA, DaniëlActa informatica, 2012-09, Vol.49 (6), p.381-394 [Periódico revisado por pares]Heidelberg: SpringerTexto completo disponível |
|
6 |
Material Type: Artigo
|
Irreversible 2-conversion set in graphs of bounded degreeKyncl, Jan ; Lidicky, Bernard ; Vyskocil, TomasDiscrete Mathematics and Theoretical Computer Science, 2017-11, Vol.19 (3), p.1 [Periódico revisado por pares]Nancy: DMTCSTexto completo disponível |
|
7 |
Material Type: Artigo
|
Making Kr+1-free graphs r-partiteBalogh, József ; Clemen, Felix Christian ; Lavrov, Mikhail ; Lidický, Bernard ; Pfender, FlorianCombinatorics, probability & computing, 2021-07, Vol.30 (4), p.609-618 [Periódico revisado por pares]Cambridge: Cambridge University PressTexto completo disponível |
|
8 |
Material Type: Artigo
|
Minimizing the number of 5-cycles in graphs with given edge-densityBennett, Patrick ; Dudek, Andrzej ; Lidický, Bernard ; Pikhurko, OlegCombinatorics, probability & computing, 2020-01, Vol.29 (1), p.44-67 [Periódico revisado por pares]Cambridge: Cambridge University PressTexto completo disponível |
|
9 |
Material Type: Artigo
|
Minimum Number of Monotone Subsequences of Length 4 in PermutationsBALOGH, JÓZSEF ; HU, PING ; LIDICKÝ, BERNARD ; PIKHURKO, OLEG ; UDVARI, BALÁZS ; VOLEC, JANCombinatorics, probability & computing, 2015-07, Vol.24 (4), p.658-679 [Periódico revisado por pares]Cambridge, UK: Cambridge University PressTexto completo disponível |
|
10 |
Material Type: Artigo
|
On tripartite common graphsGrzesik, Andrzej ; Lee, Joonkyung ; Lidický, Bernard ; Volec, JanCombinatorics, probability & computing, 2022-09, Vol.31 (5), p.907-923 [Periódico revisado por pares]Cambridge: Cambridge University PressTexto completo disponível |