Blar i Faculty of Mathematics and Natural Sciences på tidsskrift "Discrete Mathematics"
Viser treff 1-6 av 6
-
Kernels of digraphs with finitely many ends
(Journal article; Peer reviewed, 2019)According to Richardson’s theorem, every digraph without directed odd cycles that is either (a) locally finite or (b) rayless has a kernel (an independent subset with an incoming edge from every vertex in ). We generalize ... -
On the maximum number of edges in planar graphs of bounded degree and matching number
(Journal article; Peer reviewed, 2023)We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number. -
Reducing the domination number of graphs via edge contractions and vertex deletions
(Journal article; Peer reviewed, 2021)In this work, we study the following problem: given a connected graph G, can we reduce the domination number of G by at least one using k edge contractions, for some fixed integer k>0? We show that for k=1 (resp. k=2), the ... -
Transversals of longest paths
(Journal article; Peer reviewed, 2020-03)Let lpt(G) be the minimum cardinality of a transversal of longest paths in G, that is, a set of vertices that intersects all longest paths in a graph G. There are several results in the literature bounding the value of ... -
The weight spectrum of two families of Reed-Muller codes
(Journal article; Peer reviewed, 2023)We determine the weight spectra of the Reed-Muller codes RM (m− 3, m) for m ≥ 6 and RM (m − 4, m) for m ≥ 8. The technique used is induction on m, using that the sum of two weights in RM (r −1, m−1) is a weight in RM (r, ... -
Well-partitioned chordal graphs
(Journal article; Peer reviewed, 2022)We introduce a new subclass of chordal graphs that generalizes the class of split graphs, which we call well-partitioned chordal graphs. A connected graph G is a well-partitioned chordal graph if there exist a partition P ...