A generalization of the dichromatic polynomial of a graph.
Farrell, E.J. (1981)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Farrell, E.J. (1981)
International Journal of Mathematics and Mathematical Sciences
Similarity:
D. M. Cvetković (1975)
Matematički Vesnik
Similarity:
Don R. Lick (1976)
Colloquium Mathematicae
Similarity:
Dragoš M. Cvetković, Irena Pevac (1983)
Publications de l'Institut Mathématique
Similarity:
J. Nieminen (1975)
Applicationes Mathematicae
Similarity:
Terry A. Mckee (2010)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is ptolemaic if and only if it is both chordal and distance-hereditary. Thus, a ptolemaic graph G has two kinds of intersection graph representations: one from being chordal, and the other from being distance-hereditary. The first of these, called a clique tree representation, is easily generated from the clique graph of G (the intersection graph of the maximal complete subgraphs of G). The second intersection graph representation can also be generated from the clique graph,...
Farrell, E.J. (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Marián Sudolský (1978)
Mathematica Slovaca
Similarity: