Image de couverture de livre

Network fault costs based on minimum leaf spanning trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Goedgebeur, Jan, Renders, Jarne, Wiener, Gábor, Zamfirescu, Carol T.
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

HIST-Critical Graphs and Malkevitch's Conjecture
par: Goedgebeur, Jan, et autres
Publié: (2024)

$K_2$-Hamiltonian Graphs: II
par: Goedgebeur, Jan, et autres
Publié: (2023)

The Frank number and nowhere-zero flows on graphs
par: Goedgebeur, Jan, et autres
Publié: (2023)

Generation of Cycle Permutation Graphs and Permutation Snarks
par: Goedgebeur, Jan, et autres
Publié: (2024)

Generation and New Infinite Families of $K_2$-hypohamiltonian Graphs
par: Goedgebeur, Jan, et autres
Publié: (2023)

On the existence of factors intersecting sets of cycles in regular graphs
par: Goedgebeur, Jan, et autres
Publié: (2024)

Infinite families of planar graphs of a given injective chromatic number
par: Daneels, Matias, et autres
Publié: (2024)

M-convexity of the minimum-cost packings of arborescences
par: Takazawa, Kenjiro
Publié: (2018)

A complete $t$-intersection theorem for families of spanning trees
par: Iarovikova, Elizaveta, et autres
Publié: (2025)

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

tinygarden -- A java package for testing properties of spanning trees
par: Dubinsky, Manuel, et autres
Publié: (2024)

Knowledge management in House of Graphs
par: Devillez, Gauvain, et autres
Publié: (2026)

On the order-diameter ratio of girth-diameter cages
par: Cambie, Stijn, et autres
Publié: (2025)

Improved lower bounds on the maximum size of graphs with girth 5
par: Goedgebeur, Jan, et autres
Publié: (2025)

The Gray graph is pseudo 2-factor isomorphic
par: Abreu, Marien, et autres
Publié: (2025)

New small regular graphs of given girth: the cage problem and beyond
par: Exoo, Geoffrey, et autres
Publié: (2025)

Rainbow copies of spanning subgraphs
par: Cooper, Colin, et autres
Publié: (2025)

On minimum Venn diagrams
par: Brenner, Sofia, et autres
Publié: (2025)

Computational complexity of covering regular trees
par: Bok, Jan, et autres
Publié: (2025)

Reliability evaluation of Cayley graph generated by unicyclic graphs based on cyclic fault pattern
par: Tian, Ting, et autres
Publié: (2025)

Fractional domatic number and minimum degree
par: Chuet, Quentin, et autres
Publié: (2025)

On the complexity of finding a spanning even tree in a graph
par: Hanaka, Tesshu, et autres
Publié: (2024)

On the minimum number of arcs in $4$-dicritical oriented graphs
par: Havet, Frédéric, et autres
Publié: (2023)

Three-chromatic geometric hypergraphs
par: Damásdi, Gábor, et autres
Publié: (2021)

A Refutation of the Pach-Tardos Conjecture for 0-1 Matrices
par: Pettie, Seth, et autres
Publié: (2024)

Rapid mixing of the flip chain over non-crossing spanning trees
par: Anand, Konrad, et autres
Publié: (2024)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
par: Duron, Julien, et autres
Publié: (2023)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
par: Das, Sandip, et autres
Publié: (2023)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
par: Gutin, Gregory, et autres
Publié: (2024)

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

The strong vertex span of trees
par: Grašič, Mateja, et autres
Publié: (2024)

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

How to see the forest for the trees
par: Bérczi-Kovács, Erika, et autres
Publié: (2025)

Interdiction of minimum spanning trees and other matroid bases
par: Weninger, Noah, et autres
Publié: (2024)

Labeling and folding multi-labeled trees
par: Moulton, Vincent, et autres
Publié: (2025)

Conflict-free chromatic index of trees
par: Guo, Shanshan, et autres
Publié: (2024)

On coarse tree decompositions and coarse balanced separators
par: Abrishami, Tara, et autres
Publié: (2025)

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

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

Tree-partitions and small-spread tree-decompositions
par: Distel, Marc, et autres
Publié: (2026)