Copertina

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kurapov, Sergey, Davidovsky, Maxim, Polyuga, Svetlana
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Combinatorics Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
di: Kurapov, Sergey, et al.
Pubblicazione: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
di: Kurapov, Sergey, et al.
Pubblicazione: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
di: Kurapov, Sergey, et al.
Pubblicazione: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
di: Kurapov, Sergey, et al.
Pubblicazione: (2024)

Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
di: Kurapov, Sergey, et al.
Pubblicazione: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part III)
di: Kurapov, Sergey, et al.
Pubblicazione: (2025)

Algorithmic methods of finite discrete structures. Automorphism of Nonseparable Graphs
di: Kurapov, Sergey, et al.
Pubblicazione: (2024)

Algorithmic methods of finite discrete structures. The Four Color Theorem. Theory, methods, algorithms
di: Kurapov, Sergey, et al.
Pubblicazione: (2024)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
di: Jedličková, Nikola, et al.
Pubblicazione: (2023)

Faces in rectilinear drawings of complete graphs
di: Balko, Martin, et al.
Pubblicazione: (2025)

Planar cycle-extendable graphs
di: Dalwadi, Aditya Y, et al.
Pubblicazione: (2024)

Hamiltonian connectivity of some base-cobase graphs
di: Martínez-Sandoval, Leonardo, et al.
Pubblicazione: (2025)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
di: Botler, Fábio, et al.
Pubblicazione: (2024)

On the existence of factors intersecting sets of cycles in regular graphs
di: Goedgebeur, Jan, et al.
Pubblicazione: (2024)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
di: Joret, Gwenaël, et al.
Pubblicazione: (2026)

On rigid regular graphs and a problem of Babai and Pultr
di: Knauer, Kolja, et al.
Pubblicazione: (2025)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
di: Beaudou, Laurent, et al.
Pubblicazione: (2025)

On graphs with a simple structure of maximal cliques
di: Gollin, J. Pascal, et al.
Pubblicazione: (2025)

Exact rainbow numbers of cycle-related graphs in multi-hubbed wheels
di: Dai, Mengyao, et al.
Pubblicazione: (2025)

A complete solution of the Erdős-Kleitman matching problem for $n\le 3s$
di: Kupavskii, Andrey, et al.
Pubblicazione: (2025)

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
di: Ai, Jiangdong, et al.
Pubblicazione: (2025)

Twin-width of sparse random graphs
di: Hendrey, Kevin, et al.
Pubblicazione: (2023)

A note on the distinct distances problem over finite fields
di: Brukhim, Nataly, et al.
Pubblicazione: (2025)

On three domination-based identification problems in block graphs
di: Chakraborty, Dipayan, et al.
Pubblicazione: (2018)

Filling some gaps on the edge coloring problem of split graphs
di: Couto, Fernanda, et al.
Pubblicazione: (2024)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
di: Le, Hoang-Oanh, et al.
Pubblicazione: (2023)

Sample compression schemes for balls in structurally sparse graphs
di: Bourneuf, Romain, et al.
Pubblicazione: (2026)

The sandwich problem for odd-hole-free and even-hole-free graphs
di: Cameron, Kathie, et al.
Pubblicazione: (2024)

New small regular graphs of given girth: the cage problem and beyond
di: Exoo, Geoffrey, et al.
Pubblicazione: (2025)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
di: Claus, Quentin, et al.
Pubblicazione: (2026)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
di: Chakraborty, Dibyayan, et al.
Pubblicazione: (2025)

Three-dimensional graph products with unbounded stack-number
di: Eppstein, David, et al.
Pubblicazione: (2022)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
di: Adekanye, Melvin, et al.
Pubblicazione: (2024)

Characterizing optimal monitoring edge-geodetic sets for some structured graph classes
di: Foucaud, Florent, et al.
Pubblicazione: (2025)

An almost complete $t$-intersection theorem for permutations
di: Kupavskii, Andrey
Pubblicazione: (2024)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
di: Choi, Mujin, et al.
Pubblicazione: (2025)

Determining a graph from its reconfiguration graph
di: Berthe, Gaétan, et al.
Pubblicazione: (2025)

Two Proofs of the Hamiltonian Cycle Identity
di: Sawczuk, Hamilton, et al.
Pubblicazione: (2025)

Tight eigenvalue bound on the traveling salesman problem
di: Wolff, Lasse H.
Pubblicazione: (2025)

A complete $t$-intersection theorem for families of spanning trees
di: Iarovikova, Elizaveta, et al.
Pubblicazione: (2025)