Image de couverture de livre

Extended formulations for induced tree and path polytopes of chordal graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Dupont-Bouillard, Alexandre
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A column generation algorithm for finding co-3-plexes in chordal graphs
par: Dupont-Bouillard, Alexandre
Publié: (2026)

Extended formulations for the maximum weighted co-2-plex problem
par: Dupont-Bouillard, Alexandre, et autres
Publié: (2025)

Contractions in perfect graph
par: Dupont-Bouillard, Alexandre, et autres
Publié: (2024)

Extended formulations for the multilinear polytope of acyclic hypergraphs
par: Del Pia, Alberto, et autres
Publié: (2025)

Backbone colouring of chordal graphs
par: Araújo, Júlio, et autres
Publié: (2025)

Dichromatic number of chordal graphs
par: Bessy, Stéphane, et autres
Publié: (2023)

Tree-layout based graph classes: proper chordal graphs
par: Paul, Christophe, et autres
Publié: (2022)

Edge open packing on subclasses of chordal graphs
par: Santra, Kamal
Publié: (2025)

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
par: Das, Sandip, et autres
Publié: (2023)

Long induced paths in sparse graphs and graphs with forbidden patterns
par: Duron, Julien, et autres
Publié: (2024)

A quasi-optimal upper bound for induced paths in sparse graphs
par: Couëtoux, Basile, et autres
Publié: (2025)

On minimally tough chordal graphs
par: Dallard, Clément, et autres
Publié: (2022)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
par: Castelo, Emanuel, et autres
Publié: (2025)

Planar induced paths via a decomposition into non-crossing ordered graphs
par: Duron, Julien, et autres
Publié: (2025)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
par: Del Pia, Alberto, et autres
Publié: (2023)

On graphs coverable by chubby shortest paths
par: Hatzel, Meike, et autres
Publié: (2025)

Ramsey Goodness of paths and unbalanced graphs
par: Botler, Fábio, et autres
Publié: (2024)

Bipartite Turán number of paths and other trees
par: Bonamy, Marthe, et autres
Publié: (2025)

Recognition of chordal graphs and cographs which are Cover-Incomparability graphs
par: Anil, Arun, et autres
Publié: (2023)

On universal graphs for trees and treewidth $k$ graphs
par: Kaul, Neel, et autres
Publié: (2025)

Hitting all longest paths in $H$-free graphs and $H$-graphs
par: de Lima, Paloma T., et autres
Publié: (2025)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
par: Chakraborty, Dibyayan
Publié: (2025)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

On the edge expansion of random polytopes
par: Ferber, Asaf, et autres
Publié: (2025)

Lower bounds for dominating set reconfiguration on sparse (directed) graphs
par: Dirks, Jona, et autres
Publié: (2025)

Non-empty intersection of longest paths in $H$-free graphs
par: Long Jr., James A., et autres
Publié: (2023)

Long induced paths and forbidden patterns: Polylogarithmic bounds
par: Duron, Julien, et autres
Publié: (2024)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
par: Le, Hoang-Oanh, et autres
Publié: (2023)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
par: Beaudou, Laurent, et autres
Publié: (2025)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
par: Claus, Quentin, et autres
Publié: (2026)

Listing spanning trees of outerplanar graphs by pivot-exchanges
par: Behrooznia, Nastaran, et autres
Publié: (2024)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
par: Baste, Julien, et autres
Publié: (2025)

A note on the exact partition polytope of Frieze and Teng
par: Narayanan, Krishna, et autres
Publié: (2026)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
par: Jedličková, Nikola, et autres
Publié: (2023)

On the Virtual Network Embedding polytope
par: Benhamiche, Amal, et autres
Publié: (2026)

Elimination distance to bounded degree on planar graphs
par: Lindermayr, Alexander, et autres
Publié: (2020)

List coloring ordered graphs with forbidden induced subgraphs
par: Piecyk, Marta, et autres
Publié: (2025)

A Caro-Wei bound for induced linear forests in graphs
par: Joret, Gwenaël, et autres
Publié: (2024)

Generation of weighted trees, block trees and block graphs
par: Ekim, Tınaz, et autres
Publié: (2024)