Transitivity on subclasses of bipartite graphs

DOI10.1007/s10878-022-00954-yOpenAlexW4311829300MaRDI QIDQ2104170

Kamal Santra, Subhabrata 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

zbMATH Keywords

NP-completenesstransitivityperfect elimination bipartite graphsbipartite chain graphslinear algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Transitivity on subclasses of chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the Grundy chromatic number of graphs
• Some perfect coloring properties of graphs
• The domatic number problem
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Iterated colorings of graphs.
• On $k$-domatic numbers of graphs
• Inequalities for the first-fit chromatic number
• Towards a theory of domination in graphs
• Perfect Elimination and Chordal Bipartite Graphs
• New results on upper domatic number of graphs
• The upper domatic number of a graph

This page was built for publication: Transitivity on subclasses of bipartite graphs