Cover Image

Recognizing Leaf Powers and Pairwise Compatibility Graphs is NP-Complete

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	la Tour, Max Dupré, Lafond, Manuel, Ndiaye, Ndiamé
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
by: la Tour, Max Dupré, et al.
Published: (2024)

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

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

On Threshold Compatibility Graphs
by: Hakim, Sheikh Azizul, et al.
Published: (2026)

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

Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

Determining the Outerthickness of Graphs Is NP-Hard
by: Lee, Pin-Hsian, et al.
Published: (2026)

Covering Complete Geometric Graphs by Monotone Paths
by: Dumitrescu, Adrian, et al.
Published: (2025)

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

Burning Graph Powers and Branching Trees
by: Jansson, Jesper, et al.
Published: (2026)

Limit Laws for Critical Dispersion on Complete Graphs
by: De Ambroggio, Umberto, et al.
Published: (2024)

The Popular Dimension of Matchings
by: Connor, Frank, et al.
Published: (2025)

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

Recognizing Sumsets is NP-Complete
by: Abboud, Amir, et al.
Published: (2024)

A Method to Generate Multi-interval Pairwise Compatibility Graphs
by: Hayat, Seemab, et al.
Published: (2024)

Complete polyhedral description of chemical graphs of maximum degree at most 3
by: Dusollier, Valentin, et al.
Published: (2025)

On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
by: Gadouleau, Maximilien, et al.
Published: (2024)

Making Walks Count: From Silent Circles to Hamiltonian Cycles
by: Alekseyev, Max A., et al.
Published: (2016)

Characterization of Circular-arc Graphs: III. Chordal Graphs
by: Cao, Yixin, et al.
Published: (2024)

Graph Theory
by: Gilbert, Jesse D.
Published: (2011)

A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
by: Frasser, Carlos E.
Published: (2026)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs
by: Cao, Yixin, et al.
Published: (2024)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
by: Bhyravarapu, Sriram, et al.
Published: (2021)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
by: Mozhui, Khyodeno, et al.
Published: (2025)

On Modular Edge Colourings of Graphs
by: Berthe, Gaétan, et al.
Published: (2025)

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

On a Characterization of Spartan Graphs
by: Misra, Neeldhara, et al.
Published: (2025)

Characterization of Split Comparability Graphs
by: Dwary, Tithi, et al.
Published: (2025)

Word-Representation of Melon Graphs
by: Mozhui, Khyodeno, et al.
Published: (2026)

Enumerating Two-Orbit Graphs
by: Seka, David, et al.
Published: (2026)

Word-Representability of Shift Graphs
by: Roy, Suchanda, et al.
Published: (2026)

Bounds on Path Energy of Graphs
by: Narke, Amol P., et al.
Published: (2022)

Graph Reconstruction with Connectivity Queries
by: Kluk, Kacper, et al.
Published: (2024)

On Realizing Reconfiguration Graphs of Cliques
by: Hoang, Duc A.
Published: (2026)

On the Cop Number of String Graphs
by: Das, Sandip, et al.
Published: (2024)

On Tuza's Conjecture in Dense Graphs
by: Chahua, Luis, et al.
Published: (2024)

Vertex Ranking of Degenerate Graphs
by: Iacono, John, et al.
Published: (2024)

Ramanujan Graphs and Interlacing Families
by: Srivastava, Nikhil
Published: (2024)

Approximating the Network Design Problem for Potential-Based Flows
by: Klimm, Max, et al.
Published: (2026)

Lower Bounds for Leaf Rank of Leaf Powers
by: Høgemo, Svein
Published: (2024)