Cover Image

Complete polyhedral description of chemical graphs of maximum degree at most 3

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Dusollier, Valentin, Bonte, Sébastien, Devillez, Gauvain, Hertz, Alain, Mélot, Hadrien, Schindl, David
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

Extremal chemical graphs of maximum degree at most 3 for 33 degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

ChemicHull: an online tool for determining extremal chemical graphs of maximum degree at most 3 for any degree-based topological indices
by: Bonte, Sébastien, et al.
Published: (2025)

Extremal Chemical Graphs for the Arithmetic-Geometric Index
by: Hertz, Alain, et al.
Published: (2024)

PHOEG: an online tool for discovery and education in extremal graph theory
by: Bonte, Sébastien, et al.
Published: (2026)

The average size of maximal matchings in graphs
by: Hertz, Alain, et al.
Published: (2022)

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

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

Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices
by: Devillez, Gauvain, et al.
Published: (2018)

Maximum Eccentric Connectivity Index for Graphs with Given Diameter
by: Hauweele, Pierre, et al.
Published: (2018)

Using Graph Theory to Derive Inequalities for the Bell Numbers
by: Hertz, Alain, et al.
Published: (2021)

Knowledge management in House of Graphs
by: Devillez, Gauvain, et al.
Published: (2026)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Trees with maximum $σ$-irregularity under a prescribed maximum degree 6
by: Bašić, Milan
Published: (2026)

Packing chromatic critical graphs with radius at most 2
by: Gür, Aslıhan, et al.
Published: (2026)

Turán Graphs, Stability Number, and Fibonacci Index
by: Bruyère, Véronique, et al.
Published: (2008)

Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
by: Bruyère, Véronique, et al.
Published: (2008)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

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

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

Polynomial-time recognition and maximum independent set in Burling graphs
by: Rzążewski, Paweł, et al.
Published: (2024)

On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)

Sensitivity of $m$-ary functions and low degree partitions of Hamming graphs
by: Asensio, Sara, et al.
Published: (2024)

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

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

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

All Graphs with at most 8 nodes are 2-interval-PCGs
by: Calamoneri, Tiziana, et al.
Published: (2022)

Expansion of gap-planar graphs
by: Wood, David R.
Published: (2025)

The Avoider-Enforcer game on hypergraphs of rank 3
by: Galliot, Florian, et al.
Published: (2025)

On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)

Fractional domatic number and minimum degree
by: Chuet, Quentin, et al.
Published: (2025)

Tree-partitions of graphs with given pathwidth
by: Wood, David R.
Published: (2026)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

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

Faster 3-colouring algorithm for graphs of diameter 3
by: Groenland, Carla, et al.
Published: (2026)

Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)

The 1/3-conjectures for domination in cubic graphs
by: Dorbec, Paul, et al.
Published: (2024)

Coboundary and cosystolic expansion without dependence on dimension or degree
by: Dikstein, Yotam, et al.
Published: (2023)

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

Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022)