Algorithmic study of d₂-transitivity of graphs
From MaRDI portal
Publication:6561577
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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cites work
- scientific article; zbMATH DE number 3663191 (Why is no real title available?)
- scientific article; zbMATH DE number 2147949 (Why is no real title available?)
- scientific article; zbMATH DE number 3800939 (Why is no real title available?)
- A note on Grundy colorings of central graphs
- Inequalities for the first-fit chromatic number
- Iterated colorings of graphs.
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- New results on upper domatic number of graphs
- On $k$-domatic numbers of graphs
- Results on the Grundy chromatic number of graphs
- Some perfect coloring properties of graphs
- The domatic number problem
- The transitivity of a graph
- The transitivity of special graph classes
- The upper domatic number of a graph
- Towards a theory of domination in graphs
- Transitivity on subclasses of bipartite graphs
This page was built for publication: Algorithmic study of \(d_2\)-transitivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561577)
