Cover Image

$K_2$-Hamiltonian Graphs: II

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Goedgebeur, Jan, Renders, Jarne, Wiener, Gábor, Zamfirescu, Carol T.
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics 05C45, 05C38, 05C10, 05C85, 05C76
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generation and New Infinite Families of $K_2$-hypohamiltonian Graphs
by: Goedgebeur, Jan, et al.
Published: (2023)

Infinite families of planar graphs of a given injective chromatic number
by: Daneels, Matias, et al.
Published: (2024)

More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
by: Zaker, Manouchehr
Published: (2021)

Graph Burning: Bounds and Hardness
by: Antony, Dhanyamol, et al.
Published: (2024)

The basis number of 1-planar graphs
by: Bazargani, Saman, et al.
Published: (2024)

Counting Small Cycle Double Covers
by: Jooken, Jorik, et al.
Published: (2025)

Symmetry classes of Hamiltonian cycles
by: Baligacs, Julia, et al.
Published: (2025)

Graphs whose Eulerian trails have unique labels
by: Kim, Donggyu, et al.
Published: (2026)

A general lower bound for the domination number of cylindrical graphs
by: Carreño, José Juan, et al.
Published: (2018)

Hamilton decompositions of the directed 7-torus at odd modulus via root-flat certificates and a prefix-count construction
by: Park, SangHyun
Published: (2026)

On the Boxicity of Line Graphs and of Their Complements
by: Caoduro, Marco, et al.
Published: (2025)

Exploring subgraph complementation to bounded degree graphs
by: Koch, Ivo, et al.
Published: (2025)

On the girth and connectivity of cubic graphs with a unique longest cycle
by: Jooken, Jorik, et al.
Published: (2024)

Computational methods for finding bi-regular cages
by: Goedgebeur, Jan, et al.
Published: (2024)

Mutual-visibility problems on graphs of diameter two
by: Cicerone, Serafino, et al.
Published: (2024)

The strong vertex span of trees
by: Grašič, Mateja, et al.
Published: (2024)

Duality Relations of Graph Polynomials
by: Jumadildayev, Medet
Published: (2025)

On Intersection Graphs of Graphs and Hypergraphs: A Survey
by: Naik, Ranjan N.
Published: (2018)

Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths
by: Chiu, Yung-Chung, et al.
Published: (2021)

Layered tree-independence number and clique-based separators
by: Dallard, Clément, et al.
Published: (2025)

Hamiltonian paths in iterated line graphs
by: Ekstein, Jan, et al.
Published: (2025)

Bipartite Powers of Certain Classes of Bipartite Graphs
by: Paul, Indrajit, et al.
Published: (2024)

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
by: Dallard, Clément, et al.
Published: (2024)

Computing the permanental polynomial of $4k$-intercyclic bipartite graphs
by: Bapat, Ravindra B., et al.
Published: (2024)

Finding hypergraph immersion is fixed-parameter tractable
by: Meng, Xiangyi, et al.
Published: (2024)

Local Search Improvements for Soft Happy Colouring
by: Shekarriz, Mohammad Hadi, et al.
Published: (2025)

Tree decompositions meet induced matchings: beyond Max Weight Independent Set
by: Lima, Paloma T., et al.
Published: (2024)

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
by: Mkrtchyan, Vahan
Published: (2024)

On Bivariegated Graphs and Line Graphs
by: Naik, Ranjan N.
Published: (2018)

Longest cycles in vertex-transitive and highly connected graphs
by: Groenland, Carla, et al.
Published: (2024)

Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
by: Anil, Arun, et al.
Published: (2023)

$\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth
by: Zaker, Manouchehr
Published: (2024)

On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring
by: Zaker, Manouchehr
Published: (2024)

Vertex evaluation of multiplex graphs using Forman Curvature
by: Yamada, Taiki
Published: (2025)

On the structure of (dart, odd hole)-free graphs
by: Hoàng, Chính T.
Published: (2025)

Deduction, Constrained Zero Forcing, and Constrained Searching
by: Burgess, Andrea, et al.
Published: (2024)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020)

Four Dominion Growth Regimes in Trees: Forcing, Fibonacci Enumeration, Periodicity, and Stability
by: Allagan, Julian, et al.
Published: (2026)

Computing the Exchange Number in Graphs with respect to Cycle Convexity
by: Nair, Revathy S., et al.
Published: (2026)

Complexity and Structural Results for the Hull and Convexity Numbers in Cycle Convexity for Graph Products
by: Anand, Bijo S., et al.
Published: (2024)