Imagen de Portada

Planar induced paths via a decomposition into non-crossing ordered graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Duron, Julien, Jacob, Hugo
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

A note on distance-hereditary graphs whose complement is also distance-hereditary
por: Jacob, Hugo
Publicado: (2025)

Planar cycle-extendable graphs
por: Dalwadi, Aditya Y, et al.
Publicado: (2024)

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

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

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

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

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

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

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

Tree decompositions with small width, spread, order and degree
por: Wood, David R.
Publicado: (2025)

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

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

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

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
por: Chekan, Vera, et al.
Publicado: (2024)

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

The tripartite-circle crossing number of graphs with two small partition classes
por: Camacho, Charles, et al.
Publicado: (2021)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
por: Le, Hoang-Oanh, et al.
Publicado: (2023)

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

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

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

Partitioning a Planar Graph into two Triangle-Forests
por: Knauer, Kolja, et al.
Publicado: (2024)

Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
por: Pépin, Martin, et al.
Publicado: (2023)

Some short notes on oriented line graphs and related matrices
por: Antony, Jacob, et al.
Publicado: (2025)

Treewidth of Outer $k$-Planar Graphs
por: Pyzik, Rafał
Publicado: (2025)

Maximal Independent Sets in Planar Triangulations
por: Francis, P., et al.
Publicado: (2024)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
por: Hertz, Alain, et al.
Publicado: (2021)

On 1-Planar Graphs with Bounded Cop-Number
por: Bose, Prosenjit, et al.
Publicado: (2024)

Face-hitting Dominating Sets in Planar Graphs
por: Francis, P., et al.
Publicado: (2024)

Lower Bounds and properties for the average number of colors in the non-equivalent colorings of a graph
por: Hertz, Alain, et al.
Publicado: (2021)

$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)

Treewidth 2 in the Planar Graph Product Structure Theorem
por: Distel, Marc, et al.
Publicado: (2024)

Moderately beyond clique-width: reduced component max-leaf and related parameters
por: Bonnet, Édouard, et al.
Publicado: (2026)

A Simplified Proof for the Edge-Density of 4-Planar Graphs
por: Büngener, Aaron
Publicado: (2025)

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
por: D'Elia, Marco, et al.
Publicado: (2024)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
por: Goetze, Miriam, et al.
Publicado: (2024)

First-order logic axiomatization of metric graph theory
por: Chalopin, Jérémie, et al.
Publicado: (2022)

Grand zigzag knight's paths
por: Baril, Jean-Luc, et al.
Publicado: (2024)