Image de couverture de livre

Algorithmic Applications of Tyshkevich's Graph Decomposition: A Primer and a Toolkit

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cheng, Christine T., Lambert, Chelsea Ann
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics Discrete Mathematics 05C85 F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Open Packing in Graphs: Bounds and Complexity
par: Shalu, M. A., et autres
Publié: (2024)

Compact Representation of Semilinear and Terrain-like Graphs
par: Cardinal, Jean, et autres
Publié: (2025)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
par: Masařík, Tomáš, et autres
Publié: (2026)

Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$
par: Bonnet, Édouard, et autres
Publié: (2023)

Thick Forests
par: Dyer, Martin, et autres
Publié: (2023)

Expanded-clique graphs and the domination problem
par: Dourado, Mitre C., et autres
Publié: (2022)

A new density limit for unanimity in majority dynamics on random graphs
par: Kim, Jeong Han, et autres
Publié: (2025)

(Even hole, triangle)-free graphs revisited
par: Martins, Beatriz, et autres
Publié: (2026)

Unavoidable induced subgraphs in graphs with complete bipartite induced minors
par: Chudnovsky, Maria, et autres
Publié: (2024)

Graph Parameters, Universal Obstructions, and WQO
par: Paul, Christophe, et autres
Publié: (2023)

Optimal List Recoloring of Subcubic Graphs and Complete Multipartite Graphs
par: De Meyer, Lucas
Publié: (2025)

On the Boxicity of Line Graphs and of Their Complements
par: Caoduro, Marco, et autres
Publié: (2025)

An Overview of Universal Obstructions for Graph Parameters
par: Paul, Christophe, et autres
Publié: (2023)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
par: Choi, Mujin, et autres
Publié: (2025)

On Chollet's Permanent Conjecture for Graph Laplacians
par: Pant, Priyanshu, et autres
Publié: (2026)

Finding Diverse Solutions Parameterized by Cliquewidth
par: Drabik, Karolina, et autres
Publié: (2024)

Temporalizing digraphs via linear-size balanced bi-trees
par: Bessy, Stéphane, et autres
Publié: (2023)

Tree-independence number VI. Thetas and pyramids
par: Chudnovsky, Maria, et autres
Publié: (2025)

Metrics on Permutation Families Defined by a Restriction Graph
par: Tymoshenko, Danylo, et autres
Publié: (2025)

A New Temporal Interpretation of Cluster Editing
par: Bocci, Cristiano, et autres
Publié: (2022)

Lower Bounds for the Pfaffian Number of Graphs
par: Junchaya, Enrique, et autres
Publié: (2026)

Cluster deletion and clique partitioning in graphs with bounded clique number
par: Galesi, Nicola, et autres
Publié: (2025)

On λ-backbone coloring of cliques with tree backbones in linear time
par: Michalik, Krzysztof, et autres
Publié: (2021)

W-state graphs: Structure and Algorithms
par: Gajjala, Rishikesh, et autres
Publié: (2026)

On Strict Brambles
par: Lardas, Emmanouil, et autres
Publié: (2022)

Gallai's Path Decomposition for 2-degenerate Graphs
par: Anto, Nevil, et autres
Publié: (2022)

Excluding a Forest Induced Minor
par: Bonnet, Édouard, et autres
Publié: (2025)

The Directed Disjoint Paths Problem with Congestion
par: Bentert, Matthias, et autres
Publié: (2025)

The Local Structure Theorem for Graph Minors with finite index
par: Paul, Christophe, et autres
Publié: (2025)

Graphs whose vertices of degree at least 2 lie in a triangle
par: Forte, Vinicius L. do, et autres
Publié: (2022)

Catching Rats in $H$-minor-free Graphs
par: Gorsky, Maximilian, et autres
Publié: (2025)

Minimal $L^p$-congestion spanning trees on weighted graphs
par: Lafuente, Alberto Castejón, et autres
Publié: (2025)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
par: Liang, Kai
Publié: (2025)

Scarf's Algorithm on Arborescence Hypergraphs
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2024)

Breaking the Symmetries of Amenable Graphs
par: Cheng, Christine T.
Publié: (2025)

A CSP approach to Graph Sandwich Problems
par: Bodirsky, Manuel, et autres
Publié: (2025)

Exploration of $k$-edge-deficient temporal graphs in linear time
par: Lahtin, Ivan, et autres
Publié: (2026)

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
par: Loth, Jesse Campion, et autres
Publié: (2022)

The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
par: Calamoneri, Tiziana, et autres
Publié: (2025)

On the complexity of Sandwich Problems for $M$-partitions
par: Barsukov, Alexey, et autres
Publié: (2026)