Buscar
Mostrando ítems 1-10 de 624
On star and biclique edge-colorings
(Wiley, 2017-01)
A biclique of G is a maximal set of vertices that induces a complete bipartite subgraph Kp,q of G with at least one edge, and a star of a graph G is a maximal set of vertices that induces a complete bipartite graph K1,q. ...
An exact algorithm for the edge coloring by total labeling problem
(Springer, 2018-07)
This paper addresses the edge coloring by total labeling graph problem. This is a labeling of the vertices and edges of a graph such that the weights (colors) of the edges, defined by the sum of its label and the labels ...
Proper Hamiltonian Paths in Edge-Colored Multigraphs
(Elsevier, 2011-12)
A c-edge-colored multigraph has each edge colored with one of the c available colors and no two parallel edges have the same color. A proper hamiltonian path is a path containing all the vertices of the multigraph such ...
A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3
(Springer, 2016)
It is shown that Halin graphs are -edge-choosable and that graphs of tree-width 3 are -edge-choosable and -total-colourable.
Robust lane marking detection based on multi-feature fusion
(07/06/2016)
In the field of intelligent vehicle systems (IVS), color and edge of lane markings are important features for vision-based applications. This paper proposes a method to detect lane marking based on a fusion approach which ...
Clique coloring B1-EPG graphs
(Elsevier, 2017)
We consider the problem of clique coloring, that is, coloring the vertices of a given graph such that no (maximal) clique of size at least two is monocolored. It is known that interval graphs are 2-clique colorable. In ...
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 ...
Coloração de arestas distinta na vizinhança
(Universidade Tecnológica Federal do ParanáPonta GrossaBrasilDepartamento Acadêmico de InformáticaCiência da ComputaçãoUTFPR, 2017-06-29)
An edge coloring is an assignment of colors to the edges of a graph G such that edges that are incident to the same vertex receive distinct colors. Given an edge coloring of a graph G, the color-set of a vertex V is the ...