A study on token digraphs

DOI10.1016/J.DISC.2025.114951MaRDI QIDQ6857925zbMATH OpenFDO

Authors Cristina G. Fernandes, Carla Negri Lintzmayer, Juan Pablo Peña, Giovanne Santos, Ana Laura Trujillo-Negrete, José Zamora

Publication date 16 February 2026

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

NP-completenesscircumferencekernelsdichromatic numberstrong connectivitytoken graphseulerian digraphsdirected girthbidirected clique numbertoken digraphsunilateral connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Connectivity (05C40)

This page was built for publication: A study on token digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857925)