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.
में बचाया:
| मुख्य लेखकों: | , , , , |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
University of Zielona Góra
2014-02-01
|
| श्रृंखला: | Discussiones Mathematicae Graph Theory |
| विषय: | |
| ऑनलाइन पहुंच: | https://doi.org/10.7151/dmgt.1725 |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|