Algorithmic study of \(d_2\)-transitivity of graphs

DOI10.47443/dml.2023.178MaRDI QIDQ6561577

Subhabrata Paul, Kamal Santra

Publication date: 25 June 2024

Published in: DML. Discrete Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

NP-completenessbipartite graphssplit graphslinear algorithm\(d_2\)-transitivity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Results on the Grundy chromatic number of graphs
• Some perfect coloring properties of graphs
• The domatic number problem
• Iterated colorings of graphs.
• Transitivity on subclasses of bipartite graphs
• On $k$-domatic numbers of graphs
• Inequalities for the first-fit chromatic number
• Towards a theory of domination in graphs
• New results on upper domatic number of graphs
• The upper domatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic study of \(d_2\)-transitivity of graphs