Treewidth and minimum fill-in on -trapezoid graphs.
Bodlaender, Hans L., Kloks, Ton, Kratsch, Dieter, Müller, Haiko (1998)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A remark on a problem of Harary”
Treewidth and minimum fill-in on -trapezoid graphs.
Counting set covers and split graphs.
Royle, Gordon F. (2000)
Journal of Integer Sequences [electronic only]
Similarity:
The join of graphs and the binding minimality
Maria Kwaśnik, Danuta Michalak (1989)
Časopis pro pěstování matematiky
Similarity:
Bipartite diametrical graphs of diameter 4 and extreme orders.
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A note on randomly complete -partite graphs
Pavol Híc (1992)
Mathematica Slovaca
Similarity:
A note on the graph equation .
Simić, Slobodan K. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Graph equations, graph inequalities and a fixed point theorem.
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity: