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...

Descripció completa

Dades bibliogràfiques
Autors principals:	Ragnar Groot Koerkamp, Marieke van der Wegen
Format:	Article
Idioma:	English
Publicat:	Discrete Mathematics & Theoretical Computer Science 2019-06-01
Col·lecció:	Discrete Mathematics & Theoretical Computer Science
Matèries:	computer science - discrete mathematics computer science - data structures and algorithms mathematics - combinatorics mathematics - number theory
Accés en línia:	https://dmtcs.episciences.org/4931/pdf

Ítems similars

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
per: Nils Jakob Eckstein, et al.
Publicat: (2023-03-01)

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
per: Kenjiro Takazawa
Publicat: (2022-03-01)

Destroying Bicolored $P_3$s by Deleting Few Edges
per: Niels Grüttemeier, et al.
Publicat: (2021-06-01)

On the shelling antimatroids of split graphs
per: Jean Cardinal, et al.
Publicat: (2017-03-01)

On the multipacking number of grid graphs
per: Laurent Beaudou, et al.
Publicat: (2019-06-01)

Constant Congestion Brambles
per: Meike Hatzel, et al.
Publicat: (2022-03-01)

Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree
per: Julien Baste, et al.
Publicat: (2022-05-01)

Separating layered treewidth and row treewidth
per: Prosenjit Bose, et al.
Publicat: (2022-05-01)

Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs
per: Gerold Jäger, et al.
Publicat: (2023-03-01)

Further results on Hendry's Conjecture
per: Manuel Lafond, et al.
Publicat: (2022-08-01)

Bears with Hats and Independence Polynomials
per: Václav Blažej, et al.
Publicat: (2023-10-01)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
per: François Pitois, et al.
Publicat: (2024-01-01)

Contact graphs of boxes with unidirectional contacts
per: Daniel Gonçalves, et al.
Publicat: (2024-05-01)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
per: Laurent Beaudou, et al.
Publicat: (2024-04-01)

On Ramsey properties of classes with forbidden trees
per: Jan Foniok
Publicat: (2014-08-01)

Upper paired domination versus upper domination
per: Hadi Alizadeh, et al.
Publicat: (2021-12-01)

New Bounds for the Dichromatic Number of a Digraph
per: Narda Cordero-Michel, et al.
Publicat: (2019-05-01)

Catalan words avoiding pairs of length three patterns
per: Jean-Luc Baril, et al.
Publicat: (2021-04-01)

Slimness of graphs
per: Feodor F. Dragan, et al.
Publicat: (2019-03-01)

Prolific Compositions
per: Murray Tannock, et al.
Publicat: (2019-12-01)

Weak embeddings of posets to the Boolean lattice
per: Dömötör Pálvölgyi
Publicat: (2018-01-01)

Bisplit graphs satisfy the Chen-Chv\'atal conjecture
per: Laurent Beaudou, et al.
Publicat: (2019-05-01)

Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
per: Didem Gözüpek, et al.
Publicat: (2017-08-01)

On almost hypohamiltonian graphs
per: Jan Goedgebeur, et al.
Publicat: (2019-07-01)

Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid
per: Arman Boyacı, et al.
Publicat: (2017-06-01)

The 2-domination and Roman domination numbers of grid graphs
per: Michaël Rao, et al.
Publicat: (2019-05-01)

Extremal properties of flood-filling games
per: Kitty Meeks, et al.
Publicat: (2019-07-01)

Efficient enumeration of non-isomorphic interval graphs
per: Patryk Mikos
Publicat: (2021-03-01)

On Almost Well-Covered Graphs of Girth at Least 6
per: Tınaz Ekim, et al.
Publicat: (2018-11-01)

Circular Separation Dimension of a Subclass of Planar Graphs
per: Arpitha P. Bharathi, et al.
Publicat: (2017-11-01)

On the inversion number of oriented graphs
per: Jørgen Bang-Jensen, et al.
Publicat: (2022-12-01)

Two lower bounds for $p$-centered colorings
per: Loïc Dubois, et al.
Publicat: (2020-11-01)

On the VC-dimension of half-spaces with respect to convex sets
per: Nicolas Grelier, et al.
Publicat: (2021-08-01)

Fast Diameter Computation within Split Graphs
per: Guillaume Ducoffe, et al.
Publicat: (2021-11-01)

On metric properties of maps between Hamming spaces and related graph homomorphisms
per: Polyanskiy, Yury
Publicat: (2019)

Right-jumps and pattern avoiding permutations
per: Cyril Banderier, et al.
Publicat: (2017-02-01)

Equiangular lines in low dimensional Euclidean spaces
per: Greaves, Gary Royden Watson, et al.
Publicat: (2021)

Improper colourings of graphs
per: Kang, R
Publicat: (2008)

Defective Coloring on Classes of Perfect Graphs
per: Rémy Belmonte, et al.
Publicat: (2022-01-01)

An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums
per: Alexander Büchel, et al.
Publicat: (2019-01-01)