The Outer-Planar Anti-Ramsey Number of Matchings
A subgraph <i>H</i> of an edge-colored graph <i>G</i> is called rainbow if all of its edges have different colors. Let <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>a<...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-06-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/14/6/1252 |