Cover Image

M-convexity of the minimum-cost packings of arborescences

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Takazawa, Kenjiro
Format:	Preprint
Published:	2018
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On arborescence packing augmentation in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2024)

Pure Nash Equilibria in Weighted Congestion Games with Complementarities and Beyond
by: Takazawa, Kenjiro
Published: (2024)

On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
by: Kanaya, Yuga, et al.
Published: (2025)

A Gray code for arborescences of tournaments
by: Bonamy, Marthe, et al.
Published: (2026)

A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
by: Takazawa, Kenjiro
Published: (2024)

Network fault costs based on minimum leaf spanning trees
by: Goedgebeur, Jan, et al.
Published: (2025)

Edge open packing: further characterizations
by: Pandey, Arti, et al.
Published: (2025)

On minimum Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)

Fast algorithm for $S$-packing coloring of Halin graphs
by: Zhang, Xin, et al.
Published: (2025)

On graph classes with constant domination-packing ratio
by: Bonamy, Marthe, et al.
Published: (2025)

Edge open packing on subclasses of chordal graphs
by: Santra, Kamal
Published: (2025)

Regular packing of rooted hyperforests with root constraints in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2023)

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

Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well
by: Wild, Marcel
Published: (2024)

On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)

Halfspace separation in geodesic convexity
by: Nair, Niranjan
Published: (2026)

On weighted partial triangulations of convex polygons
by: Blanca, Antonio, et al.
Published: (2026)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
by: Gutin, Gregory, et al.
Published: (2024)

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
by: Martínez-Sandoval, Leonardo, et al.
Published: (2019)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
by: Hoppenot, Pierre, et al.
Published: (2024)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
by: Meunier, Anthony, et al.
Published: (2026)

Separation axiom $S_3$ for geodesic convexity in graphs
by: Chepoi, Victor
Published: (2024)

Half-space separation in monophonic convexity
by: Elaroussi, Mohammed, et al.
Published: (2024)

Weakly toll convexity and proper interval graphs
by: Dourado, Mitre C., et al.
Published: (2022)

Matroid-reachability-based decomposition into arborescences
by: Hörsch, Florian, et al.
Published: (2024)

Characterizations of graph classes via convex geometries: a survey
by: Dourado, Mitre C., et al.
Published: (2022)

Translating between the representations of an acyclic convex geometry of bounded degree
by: Defrain, Oscar, et al.
Published: (2025)

Domination and packing in graphs
by: Gómez, Renzo, et al.
Published: (2024)

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
by: Kelly, Tom, et al.
Published: (2018)

Connected Subtraction Games on Subdivided Stars
by: Dailly, Antoine, et al.
Published: (2018)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
by: Dailly, Antoine, et al.
Published: (2018)

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

On three domination-based identification problems in block graphs
by: Chakraborty, Dipayan, et al.
Published: (2018)

Partition games
by: Dailly, Antoine, et al.
Published: (2018)

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
by: Soltani, Hossein, et al.
Published: (2018)

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

Asynchronous dynamics of isomorphic Boolean networks
by: Bridoux, Florian, 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)