Compatible Spanning Circuits and Forbidden Induced Subgraphs
Work
Year: 2024
Type: article
Abstract: A compatible spanning circuit in an edge-colored graph G (not necessarily properly) is defined as a closed trail containing all vertices of G in which any two consecutively traversed edges have disti... more
Source: Graphs and Combinatorics
Cites: 26
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,890