Transitivity in some graph-classes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5619926 (Why is no real title available?)
- 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
- Domination integrity of line splitting graph and central graph of path, cycle and star graphs
- Grundy coloring in some subclasses of bipartite graphs and their complements
- Incidence matrices and interval graphs
- Inequalities for the first-fit chromatic number
- Iterated colorings of graphs.
- Linear recognition of pseudo-split graphs
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- On k-domatic numbers of graphs
- On Complementary Graphs
- On achromatic number of central graph of some graphs
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- Results on the Grundy chromatic number of graphs
- Some perfect coloring properties of graphs
- The Complexity of the Partial Order Dimension Problem
- The domatic number problem
- The splittance of a graph
- The transitivity of a graph
- The transitivity of special graph classes
- The upper domatic number of a graph
- Total domination number of central graphs
- Towards a theory of domination in graphs
- Transitivity on subclasses of bipartite graphs
This page was built for publication: Transitivity in some graph-classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912350)