Image de couverture de livre

Hoffman-London graphs: When paths minimize $H$-colorings among trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Galvin, David, Marmorino, Phillip, McMillon, Emily, Nir, JD, Redlich, Amanda
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics 05C05, 05C15, 05C35
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Long paths need not minimize $H$-colorings among trees
par: Galvin, David, et autres
Publié: (2025)

Characterizing Graphs as Algebraic Squares
par: Collins, Karen L., et autres
Publié: (2025)

Counting independent sets in regular graphs with bounded independence number
par: Galvin, David, et autres
Publié: (2024)

Extremal diameters of 3-coloring graphs of trees
par: Asgarli, Shamil, et autres
Publié: (2025)

Bounding mean orders of sub-$k$-trees of $k$-trees
par: Cambie, Stijn, et autres
Publié: (2023)

A generalization of an ear decomposition and k-trees in highly connected star-free graphs
par: Maezawa, Shun-ichi, et autres
Publié: (2025)

B-colorings of planar and outerplanar graphs
par: Martin, Ryan R., et autres
Publié: (2024)

An introduction to equitable DP coloring of graphs
par: Kierstead, H. A., et autres
Publié: (2026)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
par: Xu, Shaohan, et autres
Publié: (2025)

Monochromatic graph decompositions inspired by anti-Ramsey colorings
par: Caro, Yair, et autres
Publié: (2024)

The Turán number of path-star forests
par: Fang, Xiaona, et autres
Publié: (2023)

Solution to a $3$-path isolation problem for subcubic graphs
par: Bartolo, Karl, et autres
Publié: (2024)

A localized approach to generalized Turán problems
par: Kirsch, Rachel, et autres
Publié: (2023)

On the number of minimal forts of a graph
par: Becker, Paul, et autres
Publié: (2024)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
par: Lin, Jifu, et autres
Publié: (2024)

Equitable list coloring of sparse graphs
par: Kierstead, H. A., et autres
Publié: (2024)

The maximum number of paths of a given length in a nonhamiltonian graph
par: Li, Chengli, et autres
Publié: (2026)

Bound vertices of longest paths between two vertices in cubic graphs
par: Li, Chengli, et autres
Publié: (2024)

Every graph is eventually Turán-good
par: Morrison, Natasha, et autres
Publié: (2022)

Antidirected trees in dense digraphs
par: Stein, Maya, et autres
Publié: (2024)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
par: Bradshaw, Peter, et autres
Publié: (2024)

On the Sombor index of trees with degree restrictions
par: Andriantiana, Eric O. D., et autres
Publié: (2024)

Spanning trees with large maximum degrees
par: Yan, Jun
Publié: (2025)

How connectivity affects the extremal number of trees
par: Jiang, Suyun, et autres
Publié: (2023)

Maximum ratio of (graph) irregularities
par: Cambie, Stijn, et autres
Publié: (2026)

On the transmission irregular trees with the maximum Wiener index
par: Damnjanović, Ivan, et autres
Publié: (2025)

On the extrema of the mean subtree order of graphs
par: Cambie, Stijn, et autres
Publié: (2025)

Spectral radius and homeomorphically irreducible spanning trees of graphs
par: Gao, Bingqian, et autres
Publié: (2025)

An inverse result for Wang's theorem on extremal trees
par: Damnjanović, Ivan, et autres
Publié: (2022)

Greedy trees have minimum Sombor indices
par: Damnjanović, Ivan, et autres
Publié: (2022)

The minimum number of maximal independent sets in twin-free graphs
par: Cambie, Stijn, et autres
Publié: (2022)

Notes on embedding trees in graphs with O(|T|)-sized covers
par: Pokrovskiy, Alexey
Publié: (2024)

The density of graphs with no $\ell$-path connecting equal-degree vertices: a short proof
par: Attwa, Yamaan, et autres
Publié: (2026)

Alternating paths in oriented graphs with large semidegree
par: Skokan, Jozef, et autres
Publié: (2024)

The average solution of a TSP instance in a graph
par: Cambie, Stijn
Publié: (2022)

Hoffman colorability of graphs with smallest eigenvalue at least -2
par: De Bruyn, Bart, et autres
Publié: (2026)

Trees maximizing the number of almost-perfect matchings
par: Cambie, Stijn, et autres
Publié: (2022)

A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs
par: Kostochka, Alexandr, et autres
Publié: (2022)

Maximizing the index of signed complete graphs with spanning trees on $k$ pendant vertices
par: Li, Dan, et autres
Publié: (2024)

Tight paths in fully directed hypergraphs
par: Devine, Richard C., et autres
Publié: (2026)