Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kurapov, Sergey, Davidovsky, Maxim, Polyuga, Svetlana
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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