Transitivity on subclasses of chordal graphs

DOI10.1007/978-3-031-25211-2_30arXiv2211.13931OpenAlexW4318023029MaRDI QIDQ6132554

Kamal Santra, Subhabrata Paul

Publication date: 17 August 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.13931

zbMATH Keywords

transitivitysplit graphsNordhaus-Gaddum relationscomplement of bipartite chain graphstransitively critical graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Results on the Grundy chromatic number of graphs
• Some perfect coloring properties of graphs
• The splittance of a graph
• The domatic number problem
• On the equality of the partial Grundy and upper ochromatic numbers of graphs
• Iterated colorings of graphs.
• Transitivity on subclasses of bipartite graphs
• Grundy coloring in some subclasses of bipartite graphs and their complements
• On Complementary Graphs
• Towards a theory of domination in graphs
• The upper domatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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