Arbitrarily Partitionable {2K2, C4}-Free Graphs
A graph G = (V, E) of order n is said to be arbitrarily partitionable if for each sequence λ = (λ1, λ2, …, λp) of positive integers with λ1 +·…·+λp = n, there exists a partition (V1, V2, …, Vp) of the vertex set V such that Vi induces a connected subgraph of order λi in G for each i ∈ {1, 2, …, p}....
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
University of Zielona Góra
2022-05-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2289 |
| Tags: |
No Tags, Be the first to tag this record!
|