Transitivity on subclasses of bipartite graphs
From MaRDI portal
Publication:2104170
DOI10.1007/S10878-022-00954-YOpenAlexW4311829300MaRDI QIDQ2104170FDOQ2104170
Authors: Kamal Santra, S. Paul 
Publication date: 9 December 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.13148
Recommendations
transitivityNP-completenessbipartite chain graphsperfect elimination bipartite graphslinear algorithm
Cites Work
- Some perfect coloring properties of graphs
- Title not available (Why is that?)
- Towards a theory of domination in graphs
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- Results on the Grundy chromatic number of graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Inequalities for the first-fit chromatic number
- Title not available (Why is that?)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs
- Title not available (Why is that?)
- On $k$-domatic numbers of graphs
- The domatic number problem
- Title not available (Why is that?)
- The transitivity of a graph
- The transitivity of special graph classes
- Iterated colorings of graphs.
- The upper domatic number of a graph
- A note on Grundy colorings of central graphs
- New results on upper domatic number of graphs
Cited In (10)
- Algorithmic study of \(d_2\)-transitivity of graphs
- The transitivity of a graph
- Title not available (Why is that?)
- On subgraphs induced by transversals in vertex-partitions of graphs
- The transitivity of special graph classes
- Algorithmic study on 2-transitivity of graphs
- Transitivity on subclasses of bipartite graphs
- Disimplicial arcs, transitive vertices, and disimplicial eliminations
- Transitivity of trees
- Transitivity on subclasses of chordal graphs
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)
