A study on token digraphs
bidirected clique numbercircumferencedichromatic numberdirected girtheulerian digraphskernelsNP-completenessstrong connectivitytoken digraphstoken graphsunilateral connectivity
Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
- A combinatorial problem in logic
- Colorings and orientations of graphs
- Double vertex digraphs of digraphs
- Expressive power of digraph solvability
- Graphs with Given Group and Given Graph-Theoretical Properties
- Hamiltonian circuits and paths in subset graphs with circular adjacency
- scientific article; zbMATH DE number 146670 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Independence and matching numbers of some token graphs
- New Bounds for the Dichromatic Number of a Digraph
- On the chromatic number, colorings, and codes of the Johnson graph
- On weakly ordered systems
- Regularity and planarity of token graphs
- Resolving infinitary paradoxes
- Sur le coloriage des graphs
- Survey of double vertex graphs
- Symmetric squares of graphs
- The dichromatic number of a digraph
- The list chromatic index of a bipartite multigraph
- The packing number of the double vertex graph of the path graph
- Token graphs
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)
