Buscar
Mostrando ítems 11-19 de 19
Total-chromatic number and chromatic index of dually chordal graphs
(Elsevier Science BvAmsterdamHolanda, 1999)
On the recognition of neighborhood inclusion posets
(Elsevier Science, 2017-11)
Let G be a simple graph. When we order the different closed neighborhoods of G by inclusion, the resulting poset is called the neighborhood inclusion poset. In this paper, we show that the problem of determining whether a ...
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 ...
Navigating in a Graph by Aid of Its Spanning Tree
(2008)
Let G = (V,E) be a graph and T be a spanning tree of G.
We consider the following strategy in advancing in G from a vertex x
towards a target vertex y: from a current vertex z (initially, z = x),
unless z = y, go to a ...
Fast algorithms for some dominating induced matching problems
(Elsevier Science, 2014)