The chromatic sum of a graph: history and recent developments.
Kubicka, Ewa (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “Clique partitioning of interval graphs with submodular costs on the cliques”
The chromatic sum of a graph: history and recent developments.
-Ramsey classes and dimensions of graphs
Jan Kratochvíl (1995)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In this note, we introduce the notion of -Ramsey classes of graphs and we reveal connections to intersection dimensions of graphs.
All Ramsey numbers for connected graphs of order 9.
Brandt, Stephan, Brinkmann, Gunnar, Harmuth, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Complexity aspects of the Helly property: graphs and hypergraphs.
Dourado, Mitre C., Protti, Fábio, Szwarcfiter, Jayme L. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gradual partition of a graph into complete graphs
Josef Voldřich (1978)
Časopis pro pěstování matematiky
Similarity:
On the cost chromatic number of outerplanar, planar, and line graphs
John Mitchem, Patrick Morriss, Edward Schmeichel (1997)
Discussiones Mathematicae Graph Theory
Similarity:
We consider vertex colorings of graphs in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of the coloring is the sum of the costs incurred at each vertex. The cost chromatic number of a graph with respect to a cost set is the minimum number of colors necessary to produce a minimum cost coloring of the graph. We show that the cost chromatic number of maximal outerplanar and maximal planar graphs can be arbitrarily large and...
-colorings and -bipartite graphs.
Hoang, C.T., Le, V.B. (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
On Graph-Based Cryptography and Symbolic Computations
V. A., Ustimenko (2007)
Serdica Journal of Computing
Similarity:
We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed...