Kneser graphs are Hamiltonian
Fuente:
arXiv
Saved in:
| Main Authors: | Merino, Arturo, Mütze, Torsten, Namrata |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)
by: Mütze, Torsten, et al.
Published: (2024)
Traversing combinatorial 0/1-polytopes via optimization
by: Merino, Arturo, et al.
Published: (2023)
by: Merino, Arturo, et al.
Published: (2023)
Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023)
by: Gregor, Petr, et al.
Published: (2023)
Graphs that admit a Hamilton path are cup-stackable
by: Gregor, Petr, et al.
Published: (2024)
by: Gregor, Petr, et al.
Published: (2024)
Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)
by: Behrooznia, Nastaran, et al.
Published: (2024)
A book proof of the middle levels theorem
by: Mütze, Torsten
Published: (2023)
by: Mütze, Torsten
Published: (2023)
Combinatorial Gray codes-an updated survey
by: Mütze, Torsten
Published: (2022)
by: Mütze, Torsten
Published: (2022)
$s$-Stable Kneser Graph are Hamiltonian
by: Ledezma, Agustina V., et al.
Published: (2024)
by: Ledezma, Agustina V., et al.
Published: (2024)
Kneser Graphs of Triangulations are Hamiltonian
by: Molnar, Anton, et al.
Published: (2026)
by: Molnar, Anton, et al.
Published: (2026)
Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements
by: Brenner, Sofia, et al.
Published: (2025)
by: Brenner, Sofia, et al.
Published: (2025)
Listing faces of polytopes
by: Behrooznia, Nastaran, et al.
Published: (2024)
by: Behrooznia, Nastaran, et al.
Published: (2024)
Matchings in hypercubes extend to long cycles
by: Fink, Jiří, et al.
Published: (2024)
by: Fink, Jiří, et al.
Published: (2024)
$k$-tuple domination on Kneser graphs
by: Cornet, María Gracia, et al.
Published: (2023)
by: Cornet, María Gracia, et al.
Published: (2023)
Several Roman domination graph invariants on Kneser graphs
by: Zec, Tatjana, et al.
Published: (2022)
by: Zec, Tatjana, et al.
Published: (2022)
Clique number of xor-powers of Kneser graphs
by: Füredi, Zoltán, et al.
Published: (2025)
by: Füredi, Zoltán, et al.
Published: (2025)
Exact distance Kneser graphs
by: Ledezma, Agustina Victoria, et al.
Published: (2024)
by: Ledezma, Agustina Victoria, et al.
Published: (2024)
Alternating odd cycles and orientations of Kneser-like graphs
by: Almási, Nóra, et al.
Published: (2025)
by: Almási, Nóra, et al.
Published: (2025)
Colouring signed analogues of Kneser, Schrijver, and Borsuk graphs
by: Kuffner, Luis, et al.
Published: (2024)
by: Kuffner, Luis, et al.
Published: (2024)
On the maximum degree of induced subgraphs of the Kneser graph
by: Chau, Hou Tin, et al.
Published: (2023)
by: Chau, Hou Tin, et al.
Published: (2023)
Flips in colorful triangulations
by: Acharya, Rohan, et al.
Published: (2024)
by: Acharya, Rohan, et al.
Published: (2024)
On the treewidth of generalized q-Kneser graphs
by: Metsch, Klaus
Published: (2024)
by: Metsch, Klaus
Published: (2024)
Totally odd subdivisions in Kneser graphs
by: Echeverría, Henry, et al.
Published: (2025)
by: Echeverría, Henry, et al.
Published: (2025)
Equidistant dimension of Johnson and Kneser graphs
by: Kratica, Jozef, et al.
Published: (2024)
by: Kratica, Jozef, et al.
Published: (2024)
Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
by: Wang, Yichen, et al.
Published: (2024)
by: Wang, Yichen, et al.
Published: (2024)
Ramsey Numbers in Kneser Graphs
by: Heath, Emily, et al.
Published: (2025)
by: Heath, Emily, et al.
Published: (2025)
Cocliques in the Kneser graph on $(n-1,n)$-flags of PG$(2n,q)$
by: Heering, Philipp
Published: (2026)
by: Heering, Philipp
Published: (2026)
On minimum Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)
by: Brenner, Sofia, et al.
Published: (2025)
Injective colorings of Sierpiński-like graphs and Kneser graphs
by: Brešar, Boštjan, et al.
Published: (2024)
by: Brešar, Boštjan, et al.
Published: (2024)
The strong and doubly metric dimensions of Johnson and Kneser graphs
by: Kratica, Jozef, et al.
Published: (2026)
by: Kratica, Jozef, et al.
Published: (2026)
Odd Hadwiger's conjecture for the complements of Kneser graphs
by: Chen, Meirun, et al.
Published: (2025)
by: Chen, Meirun, et al.
Published: (2025)
Two questions on Kneser colorings
by: Inozemtsev, Eduard, et al.
Published: (2024)
by: Inozemtsev, Eduard, et al.
Published: (2024)
Colouring Complete Multipartite and Kneser-type Digraphs
by: Harutyunyan, Ararat, et al.
Published: (2023)
by: Harutyunyan, Ararat, et al.
Published: (2023)
Exploring Homological Properties of Independent Complexes of Kneser Graphs
by: Feng, Ziqin, et al.
Published: (2024)
by: Feng, Ziqin, et al.
Published: (2024)
A note on vertex Turán problems in the Kneser cube
by: Gerbner, Dániel, et al.
Published: (2024)
by: Gerbner, Dániel, et al.
Published: (2024)
The Matching Kneser Graph Conjecture For High Chromatic Numbers
by: Shaebani, Saeed
Published: (2023)
by: Shaebani, Saeed
Published: (2023)
Directed Hamiltonicity in Generalized Kneser Graphs
by: Mehry, Shahram
Published: (2025)
by: Mehry, Shahram
Published: (2025)
The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
by: Lin, Hau-Yi, et al.
Published: (2025)
by: Lin, Hau-Yi, et al.
Published: (2025)
Disproving two conjectures on the Hamiltonicity of Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)
by: Brenner, Sofia, et al.
Published: (2025)
Mutual-visibility problems in Kneser and Johnson graphs
by: Ekinci, Gülnaz Boruzanli, et al.
Published: (2024)
by: Ekinci, Gülnaz Boruzanli, et al.
Published: (2024)
Monophonic number of Kneser graphs and strongly 2-monophonic graphs
by: Brešar, Boštjan, et al.
Published: (2025)
by: Brešar, Boštjan, et al.
Published: (2025)
Similar Items
-
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024) -
Traversing combinatorial 0/1-polytopes via optimization
by: Merino, Arturo, et al.
Published: (2023) -
Combinatorial generation via permutation languages. VI. Binary trees
by: Gregor, Petr, et al.
Published: (2023) -
Graphs that admit a Hamilton path are cup-stackable
by: Gregor, Petr, et al.
Published: (2024) -
Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)