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
ऑनलाइन पहुंच:	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)