On Monochromatic Subgraphs of Edge-Colored Complete Graphs
In a red-blue coloring of a nonempty graph, every edge is colored red or blue. If the resulting edge-colored graph contains a nonempty subgraph G without isolated vertices every edge of which is colored the same, then G is said to be monochromatic.
Zapisane w:
| Główni autorzy: | , , , , |
|---|---|
| Format: | Artigo |
| Język: | Inglês |
| Wydane: |
University of Zielona Góra
2014-02-01
|
| Seria: | Discussiones Mathematicae Graph Theory |
| Hasła przedmiotowe: | |
| Dostęp online: | https://doi.org/10.7151/dmgt.1725 |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|