Transitivity on subclasses of bipartite graphs
From MaRDI portal
Publication:2104170
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?)
- scientific article; zbMATH DE number 2203240 (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
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- Perfect Elimination and Chordal Bipartite 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
Cited in
(10)- On subgraphs induced by transversals in vertex-partitions of graphs
- Algorithmic study on 2-transitivity of graphs
- The transitivity of special graph classes
- scientific article; zbMATH DE number 1146236 (Why is no real title available?)
- Disimplicial arcs, transitive vertices, and disimplicial eliminations
- Transitivity on subclasses of bipartite graphs
- Transitivity of trees
- Transitivity on subclasses of chordal graphs
- Algorithmic study of \(d_2\)-transitivity of graphs
- The transitivity of a graph
This page was built for publication: Transitivity on subclasses of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104170)