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.
Displaying similar documents to “A note on the Size-Ramsey number of long subdivisions of graphs”
Distinct distances in graph drawings.
Linear arboricity of graphs
Mirosław Truszczyński (1986)
Mathematica Slovaca
Similarity:
On graphs with prescribed subgraphs of order , and a theorem of Kelly and Merriell
Yair Caro (1994)
Czechoslovak Mathematical Journal
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:
Nonrepetitive colorings of graphs -- a survey.
Grytczuk, Jarosław (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Cores and shells of graphs
Allan Bickle (2013)
Mathematica Bohemica
Similarity:
The -core of a graph , , is the maximal induced subgraph such that , if it exists. For , the -shell of a graph is the subgraph of induced by the edges contained in the -core and not contained in the -core. The core number of a vertex is the largest value for such that , and the maximum core number of a graph, , is the maximum of the core numbers of the vertices of . A graph is -monocore if . This paper discusses some basic results on the structure of -cores and...