Cover Image

Hereditary Graph Product Structure and $\cal H$-clique-width

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hliněný, Petr, Jedelský, Jan
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics 68R10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stack and Queue Numbers of Graphs Revisited
by: Hliněný, Petr, et al.
Published: (2023)

Note on Min-k-Planar Drawings of Graphs
by: Hliněný, Petr, et al.
Published: (2024)

Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
by: Hliněný, Petr
Published: (2023)

Crossing Number is NP-hard for Constant Path-width (and Tree-width)
by: Hliněný, Petr, et al.
Published: (2024)

Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)

Grid-drawings of graphs in three-dimensions
by: Balogh, Jozsef, et al.
Published: (2024)

Harmonious Colorings: bounds, heuristics and integer-linear formulations
by: Araújo, Júlio, et al.
Published: (2026)

On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)

Structure of $k$-Matching-Planar Graphs
by: Hendrey, Kevin, et al.
Published: (2025)

Measuring Depth of Matroids
by: Balabán, Jakub, et al.
Published: (2026)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

Extremal Results on Conflict-free Coloring
by: Bhyravarapu, Sriram, et al.
Published: (2023)

Symmetric properties and two variants of shuffle-cubes
by: Lü, Huazhong, et al.
Published: (2021)

Improved bounds for acyclic coloring parameters
by: Kirousis, Lefteris, et al.
Published: (2022)

Paired many-to-many 2-disjoint path cover of Johnson graphs
by: Liu, Jinhao, et al.
Published: (2025)

Degree Realization by Bipartite Multigraphs
by: Bar-Noy, Amotz, et al.
Published: (2025)

The damage number of the Cartesian product of graphs
by: Huggan, Melissa A., et al.
Published: (2023)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
by: Munaro, Andrea, et al.
Published: (2022)

On Edge-Disjoint Maximal Outerplanar Graphs
by: Okada, Yuto, et al.
Published: (2026)

Towards Characterization of 5-List-Colorability of Toroidal Graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)

Approximate Sampling of Graphs with Near-$P$-stable Degree Intervals
by: Erdős, Péter L., et al.
Published: (2022)

Word-Representability of Graphs with respect to Split Recomposition
by: Dwary, Tithi, et al.
Published: (2024)

On solving basic equations over the semiring of functional digraphs
by: Dennunzio, Alberto, et al.
Published: (2024)

Recovery of cyclic words by their subwords
by: Luchinin, Sergey, et al.
Published: (2024)

Palindromic length of infinite aperiodic words
by: Rukavicka, Josef
Published: (2024)

String attractors and bi-infinite words
by: Béaur, Pierre, et al.
Published: (2024)

Additive word complexity and Walnut
by: Popoli, Pierre, et al.
Published: (2024)

Polygonal corona limit on multigrid dual tilings
by: Lutfalla, Victor, et al.
Published: (2024)

On the pseudorandomness of Parry--Bertrand automatic sequences
by: Popoli, Pierre, et al.
Published: (2024)

Subexponential upper bound on the number of rich words
by: Rukavicka, Josef
Published: (2025)

Remarks about the Moebius-Kantor graph
by: Knill, Oliver
Published: (2026)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

Prime Multiple Missing Graphs
by: Ghosh, Shamik
Published: (2025)

Exact Wirelength of Embedding 3-Ary n-Cubes into certain Cylinders and Trees
by: S, Rajeshwari, et al.
Published: (2022)

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, 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)

New Vertex Ordering Characterizations of Circular-Arc Bigraphs
by: Paul, Indrajit, et al.
Published: (2025)

An efficient algorithm for generating transmission irregular trees
by: Stošić, Ivan, et al.
Published: (2025)