Buscar
Mostrando ítems 21-30 de 109
Total-chromatic number and chromatic index of dually chordal graphs
(Elsevier Science BvAmsterdamHolanda, 1999)
On the complexity of the {k}-packing function problem
(Blackwell Publishers, 2017-01)
Given a positive integer k, the “ {k} -packing function problem” ({k} PF) is to find in a given graph G, a function f that assigns a nonnegative integer to the vertices of G in such a way that the sum of {k} over each ...
Colouring exact distance graphs of chordal graphs
(Elsevier, 2020)
For a graph G = (V, E) and positive integer p, the exact distance-p graph G([hp]) is the graph with vertex set V and with an edge between vertices x and y if and only if x and y have distance p. Recently, there has been ...
Chordal (1,l)- and (k,1)- graphs
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
Edge clique graphs and some classes of chordal graphs
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
Partitioning chordal graphs into independent sets and cliques
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth.
Cops and robber games, introduced by Winkler and Nowakowski (in Discrete Math. 43(2–3), 235–239, 1983) and independently defined by Quilliot (in J. Comb. Theory, Ser. B 38(1), 89–92, 1985), concern a team of cops that must ...