Jiří Fink

From MaRDI portal
(Redirected from Jiří Fink)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Matchings in hypercubes extend to long cycles
(available as arXiv preprint)
N/APaper
Minimum maximal matchings in permutahedra
The Electronic Journal of Combinatorics
2026-08-03Paper
Matchings with five directions in hypercubes extend to Hamilton cycles and paths with prescribed ends2026-07-10Paper
Faster and simpler traversal of 0/1-polytopes
(available as arXiv preprint)
2026-01-01Paper
The realization graph of every degree sequence has a Hamilton path
(available as arXiv preprint)
2026-01-01Paper
Matchings in hypercubes extend to long cycles
SIAM Journal on Discrete Mathematics
2025-10-10Paper
Matchings in hypercubes extend to long cycles2025-02-28Paper
Matchings in Hypercubes Extend to Long Cycles
(available as arXiv preprint)
2025-01-01Paper
Minimum maximal matchings in permutahedra
(available as arXiv preprint)
2025-01-01Paper
Arc-routing for winter road maintenance
Discrete Optimization
2021-10-19Paper
Gray codes extending quadratic matchings
Journal of Graph Theory
2021-06-25Paper
Greedy algorithm for local heating problem
Discrete Optimization
2021-04-21Paper
Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle
European Journal of Combinatorics
2020-06-16Paper
Matchings extend into 2-factors in hypercubes
Combinatorica
2019-05-23Paper
Towards a problem of Ruskey and Savage on matching extendability2018-01-18Paper
Linear extension diameter of level induced subposets of the Boolean lattice
European Journal of Combinatorics
2014-07-29Paper
Linear extension diameter of subposets of Boolean lattice induced by two levels2013-11-01Paper
Bounds on Gutman index
MATCH - Communications in Mathematical and in Computer Chemistry
2013-10-30Paper
Long paths and cycles in faulty hypercubes: existence, optimality, complexity
Journal of Combinatorial Optimization
2013-10-10Paper
Long cycles in hypercubes with optimal number of faulty vertices
Journal of Combinatorial Optimization
2013-01-03Paper
Testing connectivity of faulty networks in sublinear time
Journal of Discrete Algorithms
2012-09-13Paper
Some remarks on inverse Wiener index problem
Discrete Applied Mathematics
2012-08-14Paper
Gray codes with bounded weights
Discrete Mathematics
2012-08-10Paper
Efficient connectivity testing of hypercubic networks with faults
Lecture Notes in Computer Science
2011-05-19Paper
Connectivity of matching graph of hypercube
SIAM Journal on Discrete Mathematics
2010-06-01Paper
Matching graphs of hypercubes and complete bipartite graphs
European Journal of Combinatorics
2009-11-30Paper
Long paths and cycles in hypercubes with faulty vertices
Information Sciences
2009-10-01Paper
Matching graphs of Hypercubes and Complete Bipartite Graphs
Electronic Notes in Discrete Mathematics
2008-06-05Paper
Perfect matchings extend to Hamilton cycles in hypercubes
Journal of Combinatorial Theory. Series B
2007-10-10Paper


Research outcomes over time


This page was built for person: Jiří Fink