Cargando…
Between Proper and Strong Edge-Colorings of Subcubic Graphs
In a proper edge-coloring the edges of every color form a matching. A matching is induced if the end-vertices of its edges induce a matching. A strong edge-coloring is an edge-coloring in which the edges of every color form an induced matching. We consider intermediate types of edge-colorings, where...
Autores principales: | Hocquard, Hervé, Lajou, Dimitri, Lužar, Borut |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7254892/ http://dx.doi.org/10.1007/978-3-030-48966-3_27 |
Ejemplares similares
-
MaxSAT Resolution and Subcube Sums
por: Filmus, Yuval, et al.
Publicado: (2020) -
Properly colored connectivity of graphs
por: Li, Xueliang, et al.
Publicado: (2018) -
Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture
por: Stiebitz, Michael, et al.
Publicado: (2012) -
Sharp threshold for random graphs with a monochromatic triangle in every edge coloring
por: Friedgut, Ehud, et al.
Publicado: (2005) -
On Proper Labellings of Graphs with Minimum Label Sum
por: Bensmail, Julien, et al.
Publicado: (2020)