Stable gonality is computable

Stable gonality is computable

Stable gonality is a multigraph parameter that measures the complexity of a graph. It is defined using maps to trees. Those maps, in some sense, divide the edges equally over the edges of the tree; stable gonality asks for the map with the minimum number of edges mapped to each edge of the tree. Thi...

Полное описание

Библиографические подробности
Главные авторы:	Ragnar Groot Koerkamp, Marieke van der Wegen
Формат:	Статья
Язык:	English
Опубликовано:	Discrete Mathematics & Theoretical Computer Science 2019-06-01
Серии:	Discrete Mathematics & Theoretical Computer Science
Предметы:	computer science - discrete mathematics computer science - data structures and algorithms mathematics - combinatorics mathematics - number theory
Online-ссылка:	https://dmtcs.episciences.org/4931/pdf

Схожие документы

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
по: Nils Jakob Eckstein, и др.
Опубликовано: (2023-03-01)

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
по: Kenjiro Takazawa
Опубликовано: (2022-03-01)

Destroying Bicolored $P_3$s by Deleting Few Edges
по: Niels Grüttemeier, и др.
Опубликовано: (2021-06-01)

On the shelling antimatroids of split graphs
по: Jean Cardinal, и др.
Опубликовано: (2017-03-01)

On the multipacking number of grid graphs
по: Laurent Beaudou, и др.
Опубликовано: (2019-06-01)

Constant Congestion Brambles
по: Meike Hatzel, и др.
Опубликовано: (2022-03-01)

Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree
по: Julien Baste, и др.
Опубликовано: (2022-05-01)

Separating layered treewidth and row treewidth
по: Prosenjit Bose, и др.
Опубликовано: (2022-05-01)

Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs
по: Gerold Jäger, и др.
Опубликовано: (2023-03-01)

Further results on Hendry's Conjecture
по: Manuel Lafond, и др.
Опубликовано: (2022-08-01)

Bears with Hats and Independence Polynomials
по: Václav Blažej, и др.
Опубликовано: (2023-10-01)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
по: François Pitois, и др.
Опубликовано: (2024-01-01)

Contact graphs of boxes with unidirectional contacts
по: Daniel Gonçalves, и др.
Опубликовано: (2024-05-01)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
по: Laurent Beaudou, и др.
Опубликовано: (2024-04-01)

On Ramsey properties of classes with forbidden trees
по: Jan Foniok
Опубликовано: (2014-08-01)

Upper paired domination versus upper domination
по: Hadi Alizadeh, и др.
Опубликовано: (2021-12-01)

New Bounds for the Dichromatic Number of a Digraph
по: Narda Cordero-Michel, и др.
Опубликовано: (2019-05-01)

Catalan words avoiding pairs of length three patterns
по: Jean-Luc Baril, и др.
Опубликовано: (2021-04-01)

Slimness of graphs
по: Feodor F. Dragan, и др.
Опубликовано: (2019-03-01)

Prolific Compositions
по: Murray Tannock, и др.
Опубликовано: (2019-12-01)

Weak embeddings of posets to the Boolean lattice
по: Dömötör Pálvölgyi
Опубликовано: (2018-01-01)

Bisplit graphs satisfy the Chen-Chv\'atal conjecture
по: Laurent Beaudou, и др.
Опубликовано: (2019-05-01)

Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
по: Didem Gözüpek, и др.
Опубликовано: (2017-08-01)

On almost hypohamiltonian graphs
по: Jan Goedgebeur, и др.
Опубликовано: (2019-07-01)

Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid
по: Arman Boyacı, и др.
Опубликовано: (2017-06-01)

The 2-domination and Roman domination numbers of grid graphs
по: Michaël Rao, и др.
Опубликовано: (2019-05-01)

Extremal properties of flood-filling games
по: Kitty Meeks, и др.
Опубликовано: (2019-07-01)

Efficient enumeration of non-isomorphic interval graphs
по: Patryk Mikos
Опубликовано: (2021-03-01)

On Almost Well-Covered Graphs of Girth at Least 6
по: Tınaz Ekim, и др.
Опубликовано: (2018-11-01)

Circular Separation Dimension of a Subclass of Planar Graphs
по: Arpitha P. Bharathi, и др.
Опубликовано: (2017-11-01)

On the inversion number of oriented graphs
по: Jørgen Bang-Jensen, и др.
Опубликовано: (2022-12-01)

Two lower bounds for $p$-centered colorings
по: Loïc Dubois, и др.
Опубликовано: (2020-11-01)

On the VC-dimension of half-spaces with respect to convex sets
по: Nicolas Grelier, и др.
Опубликовано: (2021-08-01)

Fast Diameter Computation within Split Graphs
по: Guillaume Ducoffe, и др.
Опубликовано: (2021-11-01)

On metric properties of maps between Hamming spaces and related graph homomorphisms
по: Polyanskiy, Yury
Опубликовано: (2019)

Right-jumps and pattern avoiding permutations
по: Cyril Banderier, и др.
Опубликовано: (2017-02-01)

Equiangular lines in low dimensional Euclidean spaces
по: Greaves, Gary Royden Watson, и др.
Опубликовано: (2021)

Improper colourings of graphs
по: Kang, R
Опубликовано: (2008)

Defective Coloring on Classes of Perfect Graphs
по: Rémy Belmonte, и др.
Опубликовано: (2022-01-01)

An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums
по: Alexander Büchel, и др.
Опубликовано: (2019-01-01)