Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Beaudou, Laurent, Bok, Jan, Foucaud, Florent, Quiroz, Daniel A., Raymond, Jean-Florent
Formato:	Preprint
Publicado:	2025
Materias:	Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
por: Chakraborty, Dibyayan, et al.
Publicado: (2025)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
por: Beaudou, Laurent, et al.
Publicado: (2021)

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

Extremal digraphs for open neighbourhood location-domination and identifying codes
por: Foucaud, Florent, et al.
Publicado: (2023)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
por: Dailly, Antoine, et al.
Publicado: (2018)

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

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

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

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

Isometric path complexity of graphs
por: Chakraborty, Dibyayan, et al.
Publicado: (2022)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
por: Das, Sandip, et al.
Publicado: (2023)

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

Splitting vertices of bipartite graphs preserves de Bruijn-Erdős property
por: Beaudou, Laurent, et al.
Publicado: (2025)

On locating and neighbor-locating colorings of sparse graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2023)

Linear colorings of graphs
por: Hilaire, Claire, et al.
Publicado: (2025)

A quasi-optimal upper bound for induced paths in sparse graphs
por: Couëtoux, Basile, et al.
Publicado: (2025)

Algorithms and hardness for Metric Dimension on digraphs
por: Dailly, Antoine, et al.
Publicado: (2023)

Locating-dominating partitions for some classes of graphs
por: Foucaud, Florent, et al.
Publicado: (2025)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
por: Foucaud, Florent, et al.
Publicado: (2024)

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

On graphs coverable by k shortest paths
por: Dumas, Maël, et al.
Publicado: (2022)

Computational complexity of covering regular trees
por: Bok, Jan, et al.
Publicado: (2025)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

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

Subchromatic numbers of powers of graphs with excluded minors
por: Cortés, Pedro P., et al.
Publicado: (2023)

Long induced paths and forbidden patterns: Polylogarithmic bounds
por: Duron, Julien, et al.
Publicado: (2024)

Parameterized complexity of isometric path partition: treewidth and diameter
por: Chakraborty, Dibyayan, et al.
Publicado: (2025)

Progress towards the two-thirds conjecture on locating-total dominating sets
por: Chakraborty, Dipayan, et al.
Publicado: (2022)

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
por: Ghasemi, Fatemeh, et al.
Publicado: (2025)

List homomorphisms to separable signed graphs
por: Bok, Jan, et al.
Publicado: (2023)

On the expressive power of $2$-edge-colourings of graphs
por: Bok, Jan, et al.
Publicado: (2025)

A polynomial bound for the minimal excluded minors for a surface
por: Houdaigoui, Sarah, et al.
Publicado: (2026)

A quasi-polynomial bound for the minimal excluded minors for a surface
por: Houdaigoui, Sarah, et al.
Publicado: (2025)

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

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

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

Local certification of geometric graph classes
por: Defrain, Oscar, et al.
Publicado: (2023)

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

Adjacency labelling for proper minor-closed graph classes
por: Dujmović, Vida, et al.
Publicado: (2026)

The treewidth and pathwidth of graph unions
por: Alecu, Bogdan, et al.
Publicado: (2022)