Tournament transitivity of graphs

DOI10.1007/978-981-96-4445-2_25MaRDI QIDQ6909225zbMATH OpenFDO

Authors Kamal Santra

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1007/978-981-96-4445-2_25

zbMATH Keywords

chordal graphsNP-completenesspolynomial-time algorithmtournament transitivitytrees

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A note on Grundy colorings of central graphs
• 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?)
• Inequalities for the first-fit chromatic number
• Iterated colorings of graphs.
• New results on upper domatic number of graphs
• On k-domatic numbers of 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
• Transitivity on subclasses of bipartite graphs
• Transitivity on subclasses of chordal graphs

Cited in

(1)

• On complementarily transitivity of graphs

This page was built for publication: Tournament transitivity of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909225)