Results 21 to 30 of about 55,028 (193)
Koszul graded Möbius algebras and strongly chordal graphs [PDF]
Selecta MathematicaThe graded Möbius algebra of a matroid is a commutative graded algebra which encodes the combinatorics of the lattice of flats of the matroid. As a special subalgebra of the augmented Chow ring of the matroid, it plays an important role in the recent ...
Adam LaClair +3 more
semanticscholar +4 more sources
The parallel solution of domination problems on chordal and strongly chordal graphs
Discrete Applied Mathematics, 1994 We present efficient parallel algorithms for the domination problem on strongly chordal graphs and related problems, such as the set cover problem for α-acyclic hypergraphs and the dominating clique problem for strongly chordal graphs.
Damaschke, Peter, Dahlhaus, Elias
core +2 more sources
Further results on Hendry's Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Recently, a conjecture due to Hendry was disproved which stated that every Hamiltonian chordal graph is cycle extendible. Here we further explore the conjecture, showing that it fails to hold even when a number of extra conditions are imposed.
Manuel Lafond +2 more
doaj +1 more source
MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling [PDF]
Algebraic Combinatorics, 2022 Ideal subarrangements of a Weyl arrangement are proved to be free by the multiple addition theorem (MAT) due to Abe-Barakat-Cuntz-Hoge-Terao (2016). They form a significant class among Weyl subarrangements that are known to be free so far. The concept of
T. Tran, S. Tsujie
semanticscholar +1 more source
Partitioning Cliques of Claw-free Strongly Chordal Graphs
, 1999 In this paper we find a particular partition of the vertex set of claw-free strongly chordal graphs in which each element is a clique, and we show that the adjacency graph of these cliques is a tree.
Giordani, S +6 more
core +3 more sources
Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Dahlhaus, Marek Karpinski
semanticscholar +3 more sources
Maximum vertex-weighted matching in strongly chordal graphs
Discrete Applied Mathematics, 1998 Given a graph G = (V, E) and a real weight for each vertex of G, the vertex-weight of a matching is defined to be the sum of the weights of the vertices covered by the matching.
Klein, Sulamita, Campêlo, Manoel B.
core +2 more sources
Efficient (j, k)-Dominating Functions
Discussiones Mathematicae Graph Theory, 2023 For positive integers j and k, an efficient (j, k)-dominating function of a graph G = (V, E) is a function f : V → {0, 1, 2, . . ., j} such that the sum of function values in the closed neighbourhood of every vertex equals k. The relationship between the
Klostermeyer William F. +3 more
doaj +1 more source
On Minimum Maximal Distance-k Matchings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge analogue of $k$
Yury Kartynnik, Andrew Ryzhikov
doaj +1 more source
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +1 more source