Long rainbow paths and rainbow cycles in edge colored graphs–A survey
H Chen - Applied Mathematics and Computation, 2018 - Elsevier
Graph coloring problem and problem on the existence of paths and cycles have always
been popular topics in graph theory. The problem on the existence of rainbow paths and …
been popular topics in graph theory. The problem on the existence of rainbow paths and …
Rainbow Tur\'an problems for paths and forests of stars
For a fixed graph $ F $, we would like to determine the maximum number of edges in a
properly edge-colored graph on $ n $ vertices which does not contain a {\emph rainbow …
properly edge-colored graph on $ n $ vertices which does not contain a {\emph rainbow …
Lower bounds for rainbow Tur\'{a} n numbers of paths and other trees
D Johnston, P Rombach - arXiv preprint arXiv:1901.03308, 2019 - arxiv.org
For a fixed graph $ F $, we would like to determine the maximum number of edges in a
properly edge-colored graph on $ n $ vertices which does not contain a rainbow copy of $ F …
properly edge-colored graph on $ n $ vertices which does not contain a rainbow copy of $ F …
Zeons, orthozeons, and graph colorings
GS Staples, T Stellhorn - Advances in Applied Clifford Algebras, 2017 - Springer
Nilpotent adjacency matrix methods have proven useful for counting self-avoiding walks
(paths, trails, cycles, and circuits) in finite graphs. In the current work, these methods are …
(paths, trails, cycles, and circuits) in finite graphs. In the current work, these methods are …
Combinatorial Optimization
Combinatorial Optimization is an active research area that developed from the rich
interaction among many mathematical areas, including combinatorics, graph theory …
interaction among many mathematical areas, including combinatorics, graph theory …