On complementarily transitivity of graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4043889 (Why is no real title available?)
- scientific article; zbMATH DE number 3663191 (Why is no real title available?)
- scientific article; zbMATH DE number 125504 (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
- A review of tree convex sets test
- Algorithmic study of \(d_2\)-transitivity of graphs
- Algorithmic study on 2-transitivity of 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
- Perfect Elimination and Chordal Bipartite Graphs
- Results on the Grundy chromatic number of graphs
- Some perfect coloring properties of graphs
- Strong transitivity of a graph
- The domatic number problem
- The transitivity of a graph
- The transitivity of special graph classes
- The upper domatic number of a graph
- Tournament transitivity of graphs
- Towards a theory of domination in graphs
- Transitivity on subclasses of bipartite graphs
- Transitivity on subclasses of chordal graphs
This page was built for publication: On complementarily transitivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891674)
