Self-coalition graphs
From MaRDI portal
Recommendations
Cited in
(21)- Paired coalition in graphs
- Double coalitions in regular graphs
- On independent coalition in graphs and independent coalition graphs
- Double coalitions in graphs
- The shortest cycle having the maximal number of coalition graphs
- A characterization of graphs with given total coalition numbers
- Independent coalition in graphs: existence and characterization
- Introduction to coalitions in graphs
- Total coalitions in claw-free cubic graphs containing double-bonded triangle-units
- Characterization and recognition of some opposition and coalition graph classes
- Characterizations of graphs with equal vertex and coalition number
- Perfect coalition in graphs
- Upper bounds on the coalition number
- Coalition graphs
- Universal cycles that generate all graphs of coalition partitions in cycles
- Total k-coalition: bounds, exact values and an application to double coalition
- 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 coalition number of trees
- Singleton coalition graph chains
This page was built for publication: Self-coalition graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039594)