Copertina

Making Walks Count: From Silent Circles to Hamiltonian Cycles

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Alekseyev, Max A., Michon, Gerard P.
Natura:	Preprint
Pubblicazione:	2016
Soggetti:	Combinatorics Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Making Graphs Irregular through Irregularising Walks
di: Bensmail, Julien, et al.
Pubblicazione: (2025)

Gathering Information about a Graph by Counting Walks from a Single Vertex
di: Fuhlbrück, Frank, et al.
Pubblicazione: (2024)

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
di: Frieze, Alan, et al.
Pubblicazione: (2023)

Plane Hamiltonian Cycles in Convex Drawings
di: Bergold, Helena, et al.
Pubblicazione: (2024)

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
di: Aichholzer, Oswin, et al.
Pubblicazione: (2024)

Menger's Theorem for Temporal Paths (Not Walks)
di: Ibiapina, Allen, et al.
Pubblicazione: (2022)

On partitions into squares of distinct integers whose reciprocals sum to 1
di: Alekseyev, Max A.
Pubblicazione: (2018)

Computing bounded solutions to linear Diophantine equations with the sum of divisors
di: Alekseyev, Max A.
Pubblicazione: (2026)

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

Counting the minimum number of arcs in an oriented graph having weak diameter 2
di: Das, Sandip, et al.
Pubblicazione: (2023)

Counting Colored Tilings on Grids and Graphs
di: Ramírez, José L., et al.
Pubblicazione: (2024)

The Rainbow Arborescence Problem on Cycles
di: Bérczi, Kristóf, et al.
Pubblicazione: (2025)

On $k$-planar Graphs without Short Cycles
di: Bekos, Michael A., et al.
Pubblicazione: (2024)

Counting the Number of Domatic Partition of a Graph
di: Alikhani, Saeid, et al.
Pubblicazione: (2024)

Graphs With the Same Edge Count in Each Neighborhood
di: Sheffield, Nathan S., et al.
Pubblicazione: (2025)

Proper Rainbow Saturation Numbers for Cycles
di: Halfpap, Anastasia, et al.
Pubblicazione: (2024)

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

Generation of Cycle Permutation Graphs and Permutation Snarks
di: Goedgebeur, Jan, et al.
Pubblicazione: (2024)

Minimum Spanning Tree Cycle Intersection Problem
di: Dubinsky, Manuel, et al.
Pubblicazione: (2021)

On $(k,g)$-Graphs without $(g+1)$-Cycles
di: Eze, Leonard Chidiebere, et al.
Pubblicazione: (2024)

Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
di: Gerke, S., et al.
Pubblicazione: (2026)

Onion De Bruijn Sequences: Fixed-Window Counting by Growing the Alphabet
di: Genosar, Dor, et al.
Pubblicazione: (2019)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
di: Adak, Rajat, et al.
Pubblicazione: (2025)

Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
di: Hatzel, Meike, et al.
Pubblicazione: (2026)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
di: Kurapov, Sergey, et al.
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)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
di: Gajjala, Rishikesh
Pubblicazione: (2026)

Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete
di: la Tour, Max Dupré, et al.
Pubblicazione: (2025)

Approximating the Network Design Problem for Potential-Based Flows
di: Klimm, Max, et al.
Pubblicazione: (2026)

$ε$-Uniform Mixing in Discrete Quantum Walks
di: Zhan, Hanmeng
Pubblicazione: (2023)

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
di: la Tour, Max Dupré, et al.
Pubblicazione: (2024)

Pseudorandomness of Expander Walks via Fourier Analysis on Groups
di: Jeronimo, Fernando Granha, et al.
Pubblicazione: (2025)

Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices
di: Mohan, Amulya, et al.
Pubblicazione: (2024)

From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
di: Kirchweger, Markus, et al.
Pubblicazione: (2025)

Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations
di: Alekseyev, Max A.
Pubblicazione: (2023)

Bounds on Path Energy of Graphs
di: Narke, Amol P., et al.
Pubblicazione: (2022)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
di: Bhyravarapu, Sriram, et al.
Pubblicazione: (2021)

Path degeneracy and applications
di: Lin, Y., et al.
Pubblicazione: (2025)

On approximating the rank of graph divisors
di: Bérczi, Kristóf, et al.
Pubblicazione: (2022)