Buscar
Mostrando ítems 21-30 de 168
Edge Coloring Of Split Graphs
(, 2008)
Caracterização e coloração de arestas em grafos split-co-comparabilidade
(Universidade Tecnológica Federal do ParanáPonta GrossaBrasilDepartamento Acadêmico de InformáticaCiência da ComputaçãoUTFPR, 2018-06-13)
A characterization of a graph class is the determination of structural properties that uniquely identify the graphs in this class. Those characterizations can give important information that supports many combinatorial ...
THE COMPLEXITY OF APPROXIMATING THE ORIENTED DIAMETER OF CHORDAL GRAPHS
(SPRINGER, 2002)
The oriented diameter of a (undirected) graph G is the smallest diameter among all the diameters of strongly connected orientations of G. We study algorithmic aspects of determining the oriented diameter of a chordal graph. ...
The splitting number and skewness of C-n x C-m
(Charles Babbage Res CtrWinnipegCanadá, 2002)
Grundy dominating sequences on X-join product
(Elsevier Science, 2020-09)
In this paper we study the Grundy domination number on the X-join product G↩R of a graph G and a family of graphs R={Gv:v∈V(G)}. The results led us to extend the few known families of graphs where this parameter can be ...
Coloração de arestas em grafos split-comparabilidade e split-intervalos
(Universidade Tecnológica Federal do ParanáPonta GrossaBrasilPrograma de Pós-Graduação em Ciência da ComputaçãoUTFPR, 2021-04-20)
A proper edge coloring of a graph is an assignment of colors to its edges such that edges incident with the same vertex have distinct colors. The Edge Coloring Problem is answering, given a graph, which is the least number ...
Recognizing vertex intersection graphs of paths on bounded degree trees
(Elsevier, 2014-02)
An (h, s, t)-representation of a graph G consists of a collection of subtrees of a tree T , where each subtree corresponds to a vertex of G such that (i) the maximum degree of T is at most h, (ii) every subtree has maximum ...