Cover Image

Hamiltonian connectivity of some base-cobase graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Martínez-Sandoval, Leonardo, Knauer, Kolja
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

What is and is not inside a Cayley graph?
by: Knauer, Kolja, et al.
Published: (2025)

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

Concepts of Dimension for Convex Geometries
by: Knauer, Kolja, et al.
Published: (2023)

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
by: Asensio, Sara, et al.
Published: (2024)

Partitioning a Planar Graph into two Triangle-Forests
by: Knauer, Kolja, et al.
Published: (2024)

Partitions of planar (oriented) graphs into a connected acyclic and an independent set
by: Cambie, Stijn, et al.
Published: (2024)

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

Lattice path matroids and quotients
by: Benedetti, Carolina, et al.
Published: (2022)

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
by: Martínez-Sandoval, Leonardo, et al.
Published: (2019)

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians
by: Bénéteau, Laurine, et al.
Published: (2022)

On the balanceability of some graph classes
by: Dailly, Antoine, et al.
Published: (2020)

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

Computing Treedepth Obstructions
by: Kühn, Kolja
Published: (2025)

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

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

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
by: Ortlieb, Christian, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Hamiltonian cycle of a complete graph and the Traveling salesman problem
by: Kurapov, Sergey, et al.
Published: (2024)

Reliability evaluation of Cayley graph generated by unicyclic graphs based on cyclic fault pattern
by: Tian, Ting, et al.
Published: (2025)

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

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

Dominion of some graphs
by: Allagan, Julian, et al.
Published: (2025)

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

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

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

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)

Increasing arc-connectivity by bounded- and fixed-size inversions
by: Hörsch, Florian, et al.
Published: (2026)

Making Walks Count: From Silent Circles to Hamiltonian Cycles
by: Alekseyev, Max A., et al.
Published: (2016)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs
by: Garzón, E. M., et al.
Published: (2024)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)

On total transitivity of graphs
by: Santra, Kamal
Published: (2025)