A note on two comparability graphs
C. S., Jr. Johnson, Frederick R. McMorris (1982)
Mathematica Slovaca
Similarity:
Displaying similar documents to “Clique graph representations of ptolemaic graphs”
A note on two comparability graphs
The k-point-arboricity of a graph
Don R. Lick (1976)
Colloquium Mathematicae
Similarity:
Some applications of graph theory in the theory of hypergraphs
J. Nieminen (1975)
Applicationes Mathematicae
Similarity:
The determinant concept defined by means of graph theory
D. M. Cvetković (1975)
Matematički Vesnik
Similarity:
Dual point-partition number of complementary graphs
Anton Kundrík (1990)
Mathematica Slovaca
Similarity:
Discussing Graph Theory with a Computer III, Man-machine Theorem Proving
Dragoš M. Cvetković, Irena Pevac (1983)
Publications de l'Institut Mathématique
Similarity:
A generalization of the friendship theorem
Marián Sudolský (1978)
Mathematica Slovaca
Similarity:
Recognizing Chordal Graphs: Lex BFS and MCS 1
Broderick Arneson, Piotr Rudnicki (2006)
Formalized Mathematics
Similarity:
We are formalizing the algorithm for recognizing chordal graphs by lexicographic breadth-first search as presented in [13, Section 3 of Chapter 4, pp. 81-84]. Then we follow with a formalization of another algorithm serving the same end but based on maximum cardinality search as presented by Tarjan and Yannakakis [25].This work is a part of the MSc work of the first author under supervision of the second author. We would like to thank one of the anonymous reviewers for very useful suggestions. ...