Cover Image

Adjacency labelling for proper minor-closed graph classes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dujmović, Vida, Gavoille, Cyril, Joret, Gwenaël, Micek, Piotr, Morin, Pat, Wood, David R.
Format:	Preprint
Published:	2026
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tight bound for the Erdős-Pósa property of tree minors
by: Dujmović, Vida, et al.
Published: (2024)

Erdős--Pósa property of cycles that are far apart
by: Dujmović, Vida, et al.
Published: (2024)

Planar graphs in blowups of fans
by: Distel, Marc, et al.
Published: (2024)

The Excluded Tree Minor Theorem Revisited
by: Dujmović, Vida, et al.
Published: (2023)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Grid Minors and Products
by: Dujmović, Vida, et al.
Published: (2024)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

3-Colouring Planar Graphs
by: Dujmović, Vida, et al.
Published: (2025)

Cliquewidth and dimension
by: Joret, Gwenaël, et al.
Published: (2023)

Free Sets in Planar Graphs: History and Applications
by: Dujmović, Vida, et al.
Published: (2024)

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

Excluding an apex-forest or a fan as quickly as possible
by: Claus, Quentin, et al.
Published: (2026)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)

Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)

Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)

A Caro-Wei bound for induced linear forests in graphs
by: Joret, Gwenaël, et al.
Published: (2024)

Vertex Ranking of Degenerate Graphs
by: Iacono, John, et al.
Published: (2024)

Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
by: Dujmović, Vida, et al.
Published: (2022)

Linear versus centred chromatic numbers
by: Bose, Prosenjit, et al.
Published: (2022)

Connected Dominating Sets in Triangulations
by: Bose, Prosenjit, et al.
Published: (2023)

Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
by: Bonnet, Édouard, et al.
Published: (2022)

Lower Bounds for Induced-Universal Graphs
by: Gavoille, Cyril, et al.
Published: (2025)

Pathwidth vs cocircumference
by: Briański, Marcin, et al.
Published: (2023)

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)

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

Quickly excluding an apex-forest
by: Hodor, Jędrzej, et al.
Published: (2024)

Expansion of gap-planar graphs
by: Wood, David R.
Published: (2025)

Tree-partitions of graphs with given pathwidth
by: Wood, David R.
Published: (2026)

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

Basis Number and Pathwidth
by: Miraftab, Babak, et al.
Published: (2026)

Cops and Robbers for Graphs on Surfaces with Crossings
by: Bose, Prosenjit, et al.
Published: (2025)

Separation Number and Treewidth, Revisited
by: Houdrouge, Hussein, et al.
Published: (2025)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
by: Bonamy, Marthe, et al.
Published: (2020)

Directed treewidth is closed under taking butterfly minors
by: Kim, Gunwoo, et al.
Published: (2025)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)

On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
by: Richomme, Gwenaël
Published: (2025)