:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Rozum, Jordan C, Rocha, Luis M
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics
Accès en ligne:	https://arxiv.org/abs/2403.12705
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Network fault costs based on minimum leaf spanning trees
par: Goedgebeur, Jan, et autres
Publié: (2025)

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

On the number of asynchronous attractors in AND-NOT Boolean networks
par: Trinh, Van-Giang, et autres
Publié: (2025)

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

The treewidth and pathwidth of graph unions
par: Alecu, Bogdan, et autres
Publié: (2022)

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

Basis sequence reconfiguration in the union of matroids
par: Hanaka, Tesshu, et autres
Publié: (2024)

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

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

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

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

Bounds on treewidth via excluding disjoint unions of cycles
par: Hatzel, Meike, et autres
Publié: (2025)

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

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

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

A Vizing-like theorem for union vertex-distinguishing edge coloring
par: Bousquet, Nicolas, et autres
Publié: (2016)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
par: Joret, Gwenaël, et autres
Publié: (2026)

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)

Enumerating all geodesics
par: Wild, Marcel
Publié: (2024)

A review of minimum cost box searching games
par: Lidbetter, Thomas
Publié: (2025)

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

Using random spanning trees in survivable networks design
par: Wrobel, Blazej, et autres
Publié: (2025)

Subtractive random forests
par: Broutin, Nicolas, et autres
Publié: (2022)

Quickly excluding an apex-forest
par: Hodor, Jędrzej, et autres
Publié: (2024)

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

Efficient search of a minimum tree on points in a space with the $l_1$-norm
par: Kaymakov, K. V., et autres
Publié: (2024)

Generating pivot Gray codes for spanning trees of complete graphs in constant amortized time
par: Liu, Bowie, et autres
Publié: (2025)

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

Excluding an apex-forest or a fan as quickly as possible
par: Claus, Quentin, et autres
Publié: (2026)

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

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

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

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
par: Hörsch, Florian, et autres
Publié: (2024)

Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
par: Pierre, Laurent
Publié: (2016)

Achievable Burning Densities of Growing Grids
par: Barrett, Jordan, et autres
Publié: (2026)

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics
par: Galanis, Andreas, et autres
Publié: (2023)

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

Models of random spanning trees
par: Babson, Eric, et autres
Publié: (2024)

Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems
par: Santos, Daniela Scherer dos, et autres
Publié: (2024)