Distinct distances in graph drawings.
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
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.
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 “Recent results of Novosibirsk mathematicians in graph theory”
Distinct distances in graph drawings.
Acyclic chromatic index and linear arboricity of graphs
Filip Guldan (1991)
Mathematica Slovaca
Similarity:
A survey of minimum saturated graphs.
Faudree, Jill R., Faudree, Ralph J., Schmitt, John R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Planarizing graphs---a survey and annotated bibliography.
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
Bounded-degree graphs have arbitrarily large geometric thickness.
Barát, János, Matoušek, Jirí, Wood, David R. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On graphs with prescribed subgraphs of order , and a theorem of Kelly and Merriell
Yair Caro (1994)
Czechoslovak Mathematical Journal
Similarity: