On star and biclique edge-colorings

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. A biclique (resp. star) edge-coloring is a coloring of the edges of a graph wit...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Dantas, S., Groshaus, M., Guedes, A., Machado, R.C.S., Ries, B., Sasaki, D.
Formato: JOUR
Materias:
biclique edge-coloring
NP-hard
star edge-coloring
Coloring
Polynomial approximation
Set theory
Stars
Bicliques
Chordal bipartite graph
Complete bipartite graphs
Edge coloring
Free graphs
Polynomial-time algorithms
Two-color
Graph theory
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_09696016_v24_n1-2_p339_Dantas
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares