Imagen de Portada

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	la Tour, Max Dupré, Lafond, Manuel, Ndiaye, Ndiamé, Vetta, Adrian
Formato:	Preprint
Publicado:	2024
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

Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete
por: la Tour, Max Dupré, et al.
Publicado: (2025)

On the hardness of recognizing graphs of small mim-width and its variants
por: la Tour, Max Dupré, et al.
Publicado: (2025)

Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2025)

Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2025)

The Popular Dimension of Matchings
por: Connor, Frank, et al.
Publicado: (2025)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
por: Mählmann, Nikolas
Publicado: (2025)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
por: Lozin, Vadim, et al.
Publicado: (2022)

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

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
por: Dumitrescu, Adrian, et al.
Publicado: (2024)

Asymptotically Enumerating Independent Sets in Regular $k$-Partite $k$-Uniform Hypergraphs
por: Arras, Patrick, et al.
Publicado: (2024)

Complexity of the Feedback Vertex Set Problem in Tournaments with Forbidden Subtournaments
por: Spirkl, Sophie, et al.
Publicado: (2026)

Theoretical and Computational Approaches to Determining Sets of Orders for $(k,g)$-Graphs
por: Eze, L. C., et al.
Publicado: (2025)

On Generalizations of Pairwise Compatibility Graphs
por: Calamoneri, Tiziana, et al.
Publicado: (2021)

Path Eccentricity and Forbidden Induced Subgraphs
por: Cichacz, Sylwia, et al.
Publicado: (2025)

On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs
por: D'Elia, Marco, et al.
Publicado: (2026)

Forbidden Patterns in Mixed Linear Layouts
por: Haun, Deborah, et al.
Publicado: (2024)

Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
por: Picasarri-Arrieta, Lucas, et al.
Publicado: (2023)

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

Sums of $k$-bonacci Numbers
por: Parks, Harold R., et al.
Publicado: (2022)

$k$-Hyperopic Cops and Robber
por: Crawford, Nicholas, et al.
Publicado: (2024)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
por: Bastida, Sam, et al.
Publicado: (2026)

Discrepancy And Fair Division For Non-Additive Valuations
por: la Tour, Max Dupre, et al.
Publicado: (2025)

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

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

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

A Direct Proof of the Short-Side Advantage in Random Matching Markets
por: Mauras, Simon, et al.
Publicado: (2025)

On $(k,g)$-Graphs without $(g+1)$-Cycles
por: Eze, Leonard Chidiebere, et al.
Publicado: (2024)

An Upper Bound on the Linear Turán Number of $k$-Crowns
por: Adak, Rajat
Publicado: (2026)

Efficient $k$-limited Dominating Broadcasts in Product Graphs
por: Bharadwaj, et al.
Publicado: (2025)

Universal cycle constructions for k-subsets and k-multisets
por: Campbell, Colin, et al.
Publicado: (2026)

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

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
por: Bastide, Paul, et al.
Publicado: (2024)

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

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
por: Ai, Jiangdong, et al.
Publicado: (2024)

Efficient Algorithms and Implementations for Extracting Maximum-Size $(k,\ell)$-Sparse Subgraphs
por: Madarasi, Péter
Publicado: (2025)

Quadratic-Time Algorithm for the Maximum-Weight $(k, \ell)$-Sparse Subgraph Problem
por: Deák, Bence, et al.
Publicado: (2025)

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

On the size of k-irreducible triangulations
por: Delecroix, Vincent, et al.
Publicado: (2026)

Atropos-k is PSPACE-complete
por: Yang, Chao, et al.
Publicado: (2024)

Improved upper bounds for the Heilbronn's Problem for $k$-gons
por: Gajjala, Rishikesh, et al.
Publicado: (2024)