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

Bibliografski detalji
Glavni autori:	Ragnar Groot Koerkamp, Marieke van der Wegen
Format:	Članak
Jezik:	English
Izdano:	Discrete Mathematics & Theoretical Computer Science 2019-06-01
Serija:	Discrete Mathematics & Theoretical Computer Science
Teme:	computer science - discrete mathematics computer science - data structures and algorithms mathematics - combinatorics mathematics - number theory
Online pristup:	https://dmtcs.episciences.org/4931/pdf

Slični predmeti

Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
od: Nils Jakob Eckstein, i dr.
Izdano: (2023-03-01)

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

Destroying Bicolored $P_3$s by Deleting Few Edges
od: Niels Grüttemeier, i dr.
Izdano: (2021-06-01)

On the shelling antimatroids of split graphs
od: Jean Cardinal, i dr.
Izdano: (2017-03-01)

On the multipacking number of grid graphs
od: Laurent Beaudou, i dr.
Izdano: (2019-06-01)

Constant Congestion Brambles
od: Meike Hatzel, i dr.
Izdano: (2022-03-01)

Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree
od: Julien Baste, i dr.
Izdano: (2022-05-01)

Separating layered treewidth and row treewidth
od: Prosenjit Bose, i dr.
Izdano: (2022-05-01)

Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs
od: Gerold Jäger, i dr.
Izdano: (2023-03-01)

Further results on Hendry's Conjecture
od: Manuel Lafond, i dr.
Izdano: (2022-08-01)

Bears with Hats and Independence Polynomials
od: Václav Blažej, i dr.
Izdano: (2023-10-01)

Hypergraphs with Polynomial Representation: Introducing $r$-splits
od: François Pitois, i dr.
Izdano: (2024-01-01)

Contact graphs of boxes with unidirectional contacts
od: Daniel Gonçalves, i dr.
Izdano: (2024-05-01)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
od: Laurent Beaudou, i dr.
Izdano: (2024-04-01)

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

Upper paired domination versus upper domination
od: Hadi Alizadeh, i dr.
Izdano: (2021-12-01)

New Bounds for the Dichromatic Number of a Digraph
od: Narda Cordero-Michel, i dr.
Izdano: (2019-05-01)

Catalan words avoiding pairs of length three patterns
od: Jean-Luc Baril, i dr.
Izdano: (2021-04-01)

Slimness of graphs
od: Feodor F. Dragan, i dr.
Izdano: (2019-03-01)

Prolific Compositions
od: Murray Tannock, i dr.
Izdano: (2019-12-01)

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

Bisplit graphs satisfy the Chen-Chv\'atal conjecture
od: Laurent Beaudou, i dr.
Izdano: (2019-05-01)

Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
od: Didem Gözüpek, i dr.
Izdano: (2017-08-01)

On almost hypohamiltonian graphs
od: Jan Goedgebeur, i dr.
Izdano: (2019-07-01)

Graphs of Edge-Intersecting and Non-Splitting One Bend Paths in a Grid
od: Arman Boyacı, i dr.
Izdano: (2017-06-01)

The 2-domination and Roman domination numbers of grid graphs
od: Michaël Rao, i dr.
Izdano: (2019-05-01)

Extremal properties of flood-filling games
od: Kitty Meeks, i dr.
Izdano: (2019-07-01)

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

On Almost Well-Covered Graphs of Girth at Least 6
od: Tınaz Ekim, i dr.
Izdano: (2018-11-01)

Circular Separation Dimension of a Subclass of Planar Graphs
od: Arpitha P. Bharathi, i dr.
Izdano: (2017-11-01)

On the inversion number of oriented graphs
od: Jørgen Bang-Jensen, i dr.
Izdano: (2022-12-01)

Two lower bounds for $p$-centered colorings
od: Loïc Dubois, i dr.
Izdano: (2020-11-01)

On the VC-dimension of half-spaces with respect to convex sets
od: Nicolas Grelier, i dr.
Izdano: (2021-08-01)

Fast Diameter Computation within Split Graphs
od: Guillaume Ducoffe, i dr.
Izdano: (2021-11-01)

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

Right-jumps and pattern avoiding permutations
od: Cyril Banderier, i dr.
Izdano: (2017-02-01)

Equiangular lines in low dimensional Euclidean spaces
od: Greaves, Gary Royden Watson, i dr.
Izdano: (2021)

Improper colourings of graphs
od: Kang, R
Izdano: (2008)

Defective Coloring on Classes of Perfect Graphs
od: Rémy Belmonte, i dr.
Izdano: (2022-01-01)

An output-sensitive Algorithm to partition a Sequence of Integers into Subsets with equal Sums
od: Alexander Büchel, i dr.
Izdano: (2019-01-01)