Introduction to coalitions in graphs
From MaRDI portal
Recommendations
Cited in
(34)- Notes on coalition lattices
- On the coalition number of trees
- Upper bounds on the coalition number
- Immunity against local influence
- Self-coalition graphs
- Singleton coalition graph chains
- Coalition graphs
- A characterization of graphs with given total coalition numbers
- Independent coalition in graphs: existence and characterization
- Transversal coalitions in hypergraphs
- Total coalitions in graphs
- Total coalitions in claw-free cubic graphs containing double-bonded triangle-units
- Characterizations of graphs with equal vertex and coalition number
- Universal cycles that generate all graphs of coalition partitions in cycles
- Total restrained coalitions in graphs
- Perfect coalition in graphs
- General sharp upper bounds on the transversal coalition number
- k-coalitions in graphs
- Total coalitions of cubic graphs of order at most 10
- On the connected coalition number of graphs
- Domatic partition of some class of graphs
- Complementary coalition graphs: characterization and algorithm
- Double coalitions in regular graphs
- On independent coalition in graphs and independent coalition graphs
- General sharp upper bounds on the total coalition number
- Connected coalitions in graphs
- Coalition graphs of paths, cycles, and trees
- Paired coalition in graphs
- Double coalitions in graphs
- The minmin coalition number in graphs
- Coalition of cubic graphs of order at most 10
- The shortest cycle having the maximal number of coalition graphs
- Total k-coalition: bounds, exact values and an application to double coalition
- Fair coalition in graphs
This page was built for publication: Introduction to coalitions in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012355)
