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...
Guardado en:
| Autor principal: | Groshaus, Marina E. |
|---|---|
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_09696016_v24_n1-2_p339_Dantas http://hdl.handle.net/20.500.12110/paper_09696016_v24_n1-2_p339_Dantas |
| Aporte de: |
Ejemplares similares
Ejemplares similares
-
On star and biclique edge-colorings
por: Dantas, S., et al. -
Biclique graphs and biclique matrices
por: Groshaus, M., et al. -
Biclique graphs and biclique matrices
Publicado: (2010) -
On the iterated biclique operator
por: Groshaus, M., et al. -
b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs
Publicado: (2015)