Antidomatic number of a graph.
Zelinka, Bohdan (1996)
Archivum Mathematicum
Similarity:
Displaying similar documents to “On the pseudoachromatic number of a graph”
Antidomatic number of a graph.
Dual point-partition number of complementary graphs
Anton Kundrík (1990)
Mathematica Slovaca
Similarity:
Gradual partition of a graph into complete graphs
Josef Voldřich (1978)
Časopis pro pěstování matematiky
Similarity:
A note on the graph equation .
Simić, Slobodan K. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
A note on domatically critical and cocritical graphs
Igor Edmundovich Zverovich, Vadim E. Zverovich (1991)
Czechoslovak Mathematical Journal
Similarity:
Structural Properties of Recursively Partitionable Graphs with Connectivity 2
Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilśniak (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, . . . , np) of |V (G)| there exists a partition (V1, . . . , Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. Some stronger versions of this property were introduced, namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (OL-AP and R-AP for short, respectively), in which the subgraphs induced by a partition...