Copertina

Long induced paths in sparse graphs and graphs with forbidden patterns

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Duron, Julien, Esperet, Louis, Raymond, Jean-Florent
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Combinatorics Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

Planar induced paths via a decomposition into non-crossing ordered graphs
di: Duron, Julien, et al.
Pubblicazione: (2025)

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

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

List coloring ordered graphs with forbidden induced subgraphs
di: Piecyk, Marta, et al.
Pubblicazione: (2025)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
di: Beaudou, Laurent, et al.
Pubblicazione: (2025)

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

Linear colorings of graphs
di: Hilaire, Claire, et al.
Pubblicazione: (2025)

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

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

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

Edge densities of drawings of graphs with one forbidden cell
di: Hahn, Benedikt, et al.
Pubblicazione: (2025)

On the finiteness of $k$-vertex-critical $2P_2$-free graphs with forbidden induced squids or bulls
di: Adekanye, Melvin, et al.
Pubblicazione: (2024)

Equitable coloring of sparse graphs
di: Liu, Weichan, et al.
Pubblicazione: (2024)

Canonical labelling of sparse random graphs
di: Verbitsky, Oleg, et al.
Pubblicazione: (2024)

Twin-width of sparse random graphs
di: Hendrey, Kevin, et al.
Pubblicazione: (2023)

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem
di: Esperet, Louis, et al.
Pubblicazione: (2023)

On cuts of small chromatic number in sparse graphs
di: Aubian, Guillaume, et al.
Pubblicazione: (2025)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
di: Baste, Julien, et al.
Pubblicazione: (2025)

Hitting all longest paths in $H$-free graphs and $H$-graphs
di: de Lima, Paloma T., et al.
Pubblicazione: (2025)

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

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

Ramsey Goodness of paths and unbalanced graphs
di: Botler, Fábio, et al.
Pubblicazione: (2024)

On graphs coverable by chubby shortest paths
di: Hatzel, Meike, et al.
Pubblicazione: (2025)

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

Interval H-graphs : Recognition and forbidden obstructions
di: Müller, Haiko, et al.
Pubblicazione: (2025)

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

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

Isometric path complexity of graphs
di: Chakraborty, Dibyayan, et al.
Pubblicazione: (2022)

Reliability evaluation of Cayley graph generated by unicyclic graphs based on cyclic fault pattern
di: Tian, Ting, et al.
Pubblicazione: (2025)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
di: Duron, Julien, et al.
Pubblicazione: (2023)

Minimum stationary values of sparse random directed graphs
di: Cai, Xing Shi, et al.
Pubblicazione: (2020)

Non-empty intersection of longest paths in $H$-free graphs
di: Long Jr., James A., et al.
Pubblicazione: (2023)

Krenn-Gu conjecture for sparse graphs
di: Chandran, L. Sunil, et al.
Pubblicazione: (2024)

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

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

Nowhere-zero flow reconfiguration
di: Esperet, Louis, et al.
Pubblicazione: (2025)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
di: Jedličková, Nikola, et al.
Pubblicazione: (2023)

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