Displaying similar documents to “Triangle-free planar graphs and segment intersection graphs.”

A visibility representation for graphs in three dimensions.

Bose, Prosenjit, Everett, Hazel, Fekete, Sándor P., Houle, Michael E., Lubiw, Anna, Meijer, Henk, Romanik, Kathleen, Rote, Günter, Shermer, Thomas C., Whitesides, Sue, Zelle, Christian (1998)

Journal of Graph Algorithms and Applications

Similarity:

Bar k -visibility graphs.

Dean, Alice M., Evans, William, Gethner, Ellen, Laison, Joshua D., Safari, Mohammad Ali, Trotter, William T. (2007)

Journal of Graph Algorithms and Applications

Similarity:

Path-Neighborhood Graphs

R.C. Laskar, Henry Martyn Mulder (2013)

Discussiones Mathematicae Graph Theory

Similarity:

A path-neighborhood graph is a connected graph in which every neighborhood induces a path. In the main results the 3-sun-free path-neighborhood graphs are characterized. The 3-sun is obtained from a 6-cycle by adding three chords between the three pairs of vertices at distance 2. A Pk-graph is a path-neighborhood graph in which every neighborhood is a Pk, where Pk is the path on k vertices. The Pk-graphs are characterized for k ≤ 4.