Login
Lupa
First page / Search the repository

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 3 / 3
First pagePrevious page1Next pageLast page
1.
Colourful components in k-caterpillars and planar graphs
Janka Chlebíková, Clément Jean Dallard, 2021, original scientific article

Keywords: colorful component, caterpillar, binary tree, planar subcubic graph
Published in RUP: 18.10.2021; Views: 2649; Downloads: 28
URL Link to full text

2.
Towards a complexity dichotomy for colourful components problems on k-caterpillars and small-degree planar graphs
Janka Chlebíková, Clément Jean Dallard, 2019, published scientific conference contribution

Keywords: colorful component, caterpillar, binary tree, planar subcubic graph
Published in RUP: 11.02.2020; Views: 2755; Downloads: 133
URL Link to full text

3.
Proportionally dense subgraph of maximum size : complexity and approximation
Cristina Bazgan, Janka Chlebíková, Clément Jean Dallard, Thomas Pontoizeau, 2019, original scientific article

Keywords: dense subgraph, approximation, complexity, hamiltonian cubic graphs
Published in RUP: 11.02.2020; Views: 3145; Downloads: 130
URL Link to full text
Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica