On the k-component independence number of a tree
From MaRDI portal
Publication:2045314
Recommendations
Cites work
- (Strong) conflict-free connectivity: algorithm and complexity
- Bounded monochromatic components for random graphs
- Bounded size components -- partitions and transversals.
- Clustered colouring in minor-closed classes
- Conflict-free (vertex-)connection numbers of graphs with small diameters
- Defective and clustered graph colouring
- Fragmentability of graphs
- Graphs with the second largest number of maximal independent sets
- Maximum value of conflict-free vertex-connection number of graphs
- New upper bounds on harmonious colorings
- On conflict-free connection of graphs
- On subgraphs without large components.
- On the maximum number of maximum independent sets
- Partitioning into graphs with only small components
- Partitioning sparse graphs into an independent set and a graph with bounded size components
- The number of maximum independent sets in graphs
- The structure and maximum number of maximum independent sets in trees
- Topics in structural graph theory
Cited in
(5)- On subgraph number independence in trees
- On the asymptotic behavior of the independence number of a random (n,n)-tree
- On the independence number of some random trees
- scientific article; zbMATH DE number 32144 (Why is no real title available?)
- scientific article; zbMATH DE number 179305 (Why is no real title available?)
This page was built for publication: On the \(k\)-component independence number of a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045314)