:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Houdaigoui, Sarah, Kawarabayashi, Ken-ichi
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	https://arxiv.org/abs/2510.15212
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A polynomial bound for the minimal excluded minors for a surface
par: Houdaigoui, Sarah, et autres
Publié: (2026)

An analogue of Reed's conjecture for digraphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2024)

Coarse Menger property of quasi-minor excluded graphs and length spaces
par: Liu, Chun-Hung
Publié: (2026)

EPTAS for Hard Graph Cut Problems for Dense Graphs
par: Deguchi, Kaisei, et autres
Publié: (2026)

$(Δ-1)$-dicolouring of digraphs
par: Harutyunyan, Ararat, et autres
Publié: (2025)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
par: Joret, Gwenaël, et autres
Publié: (2026)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
par: Beaudou, Laurent, et autres
Publié: (2025)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
par: Claus, Quentin, et autres
Publié: (2026)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
par: Pilipczuk, Marcin, et autres
Publié: (2023)

Quickly excluding an apex-forest
par: Hodor, Jędrzej, et autres
Publié: (2024)

Tight bound for the Erdős-Pósa property of tree minors
par: Dujmović, Vida, et autres
Publié: (2024)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
par: Cavallaro, Dario, et autres
Publié: (2026)

Bounds on treewidth via excluding disjoint unions of cycles
par: Hatzel, Meike, et autres
Publié: (2025)

A quasi-optimal upper bound for induced paths in sparse graphs
par: Couëtoux, Basile, et autres
Publié: (2025)

Bounded twin-width graphs are polynomially $χ$-bounded
par: Bourneuf, Romain, et autres
Publié: (2023)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
par: Baste, Julien, et autres
Publié: (2025)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
par: Chakraborty, Dibyayan
Publié: (2025)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
par: Inoue, Yuta, et autres
Publié: (2024)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
par: Jedličková, Nikola, et autres
Publié: (2023)

Clique-width and induced topological minors
par: Bieliński, Paweł Rafał, et autres
Publié: (2026)

Subchromatic numbers of powers of graphs with excluded minors
par: Cortés, Pedro P., et autres
Publié: (2023)

Centered colorings in minor-closed graph classes
par: Hodor, Jędrzej, et autres
Publié: (2024)

The Four Color Theorem with Linearly Many Reducible Configurations and Near-Linear Time Coloring
par: Inoue, Yuta, et autres
Publié: (2026)

Unavoidable butterfly minors in digraphs of large cycle rank
par: Hatzel, Meike, et autres
Publié: (2025)

Directed treewidth is closed under taking butterfly minors
par: Kim, Gunwoo, et autres
Publié: (2025)

Branch-depth is minor closure of contraction-deletion-depth
par: Briański, Marcin, et autres
Publié: (2024)

Weak coloring numbers of minor-closed graph classes
par: Hodor, Jędrzej, et autres
Publié: (2024)

Adjacency labelling for proper minor-closed graph classes
par: Dujmović, Vida, et autres
Publié: (2026)

Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
par: Bonnet, Édouard, et autres
Publié: (2022)

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
par: Esperet, Louis, et autres
Publié: (2023)

Edge-Disjoint Paths in Eulerian Digraphs
par: Cavallaro, Dario, et autres
Publié: (2024)

Centered colorings and weak coloring numbers in minor-closed graph classes
par: Hodor, Jędrzej, et autres
Publié: (2026)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

Online Graph Coloring for $k$-Colorable Graphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2025)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
par: Choi, Mujin, et autres
Publié: (2025)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
par: Meunier, Anthony, et autres
Publié: (2026)

Extremal minimal bipartite matching covered graphs
par: Mallik, Amit Kumar, et autres
Publié: (2024)

Preparing graph states forbidding a vertex-minor
par: Davies, James, et autres
Publié: (2025)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
par: Gutin, Gregory, et autres
Publié: (2024)

Clustered independence and bounded treewidth
par: Knauer, Kolja, et autres
Publié: (2023)