Fakulta aplikovaných věd / Faculty of Applied Sciences

Podkomunity


Recent Submissions

Karabáš, Ján , Máčajová, Edita , Nedela, Roman , Škoviera, Martin
Girth, oddness, and colouring defect of snarks

The colouring defect of a cubic graph, introduced by Steffen in 2015, is the minimum number of edges that are left uncovered by any set of three perfect matchings. Since a cubic graph has defect 0 if and only if it is 3-edge-colourable, this invariant can measure...

Klavík, Pavel , Nedela, Roman , Zeman, Peter
Jordan-like characterization of automorphism groups of planar graphs

We investigate automorphism groups of planar graphs. The main result is a complete recursive description of all abstract groups that can be realized as automorphism groups of planar graphs. The characterization is formulated in terms of inhomogeneous wreath products. In the proof, we&#x...

Chudnovsky, Maria , Kabela, Adam , Li, Binlong , Vrána, Petr
Forbidden induced pairs for perfectness and ω-colourability of graphs

We characterise the pairs of graphs {X, Y} such that all {X, Y}-free graphs(distinct from C5) are perfect. Similarly, we characterise pairs {X, Y} such that all {X, Y}-free graphs (distinct from C5) are ω-colourable (that is, their chromatic number is equal to their clique...

Rezek, Jiří , Szelwicka, Jolanta , Vlček, Jaroslav , Čerstvý, Radomír , Houška, Jiří , Fahland, Matthias , Fahlteich, John
Transfer of the sputter technique for deposition of strongly thermochromic VO2-based coatings on ultrathin flexible glass to large-scale roll-to-roll device

The reversible semiconductor-to-metal transition of vanadium dioxide (VO2) makes VO2-based coatings a promising candidate for thermochromic smart windows, reducing the energy consumption of buildings. We report on transfer of the sputter technique for deposition of strongly thermochromic ZrO2/W-doped ...

Brause, Christoph , Doan, Trung Duy , Holub, Přemysl , Kabela, Adam , Ryjáček, Zdeněk , Schiermeyer, Ingo , Vrána, Petr
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4

For every graph X, we consider the class of all connected {K(1,3), X}-free graphs which are distinct from an odd cycle and have independence number at least 4, and we show that all graphs in the class are perfect if and only if X is an induced subgraph of&#...