Different types of products and subdirectly irreducible
E. Suková, Jiří Vinárek (1986)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Strict refinement for direct sums and graphs.”
Different types of products and subdirectly irreducible
Non-repetitive 3-coloring of subdivided graphs.
Pezarski, Andrzej, Zmarz, Michał (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The tau constant of a metrized graph and its behavior under graph operations.
Cinkir, Zubeyir (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Productive and inductive constructions of graphs
Vinárek, Jiří
Similarity:
Odd mean labeling of the graphs and
R. Vasuki, A. Nagarajan (2012)
Kragujevac Journal of Mathematics
Similarity:
The cube polynomial and its derivatives: The case of median graphs.
Brešar, Boštjan, Klavžar, Sandi, Škrekovski, Riste (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Balanced Decomposition Number of TK4 and Series-Parallel Graphs
Shinya Fujita, Henry Liu (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A balanced colouring of a graph G is a colouring of some of the vertices of G with two colours, say red and blue, such that there is the same number of vertices in each colour. The balanced decomposition number f(G) of G is the minimum integer s with the following property: For any balanced colouring of G, there is a partition V (G) = V1 ∪˙ · · · ∪˙ Vr such that, for every i, Vi induces a connected subgraph of order at most s, and contains the same number of red and blue vertices. The...