NTIS - Nové technologie pro informační společnost / NTIS - New technologies for the Information Society

Kolekce


Recent Submissions

Holub, Přemysl , Ryjáček, Zdeněk , Vrána, Petr , Wang, Shipeng , Xiong, Liming
Forbidden pairs of disconnected graphs for 2‐factor of connected graphs

In this paper, we characterize all pairs of (possibly disconnected) graphs R, S such that (i) every 2‐connected {R, S}‐free graph of sufficiently large order has a 2‐factor, and (ii) every connected {R, S}‐free graph of sufficiently large order with minimum degree at least two...

Heczko, Jan , Krystek, Jan , Kroupa, Tomáš
Crank-based cycling powermeter - construction and validation

We describe a single-sided crank-based cycling powermeter intended for mountainbike (MTB) use. The device is based on a printed circuit board (PCB) supplied by its manufacturer, but its assembly differs from the official instructions. The main difference is that the strain gauges are&#x...

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...