Displaying similar documents to “Minimal non-selfcentric radially-maximal graphs of radius 4”

On properties of maximal 1-planar graphs

Dávid Hudák, Tomáš Madaras, Yusuke Suzuki (2012)

Discussiones Mathematicae Graph Theory

Similarity:

A graph is called 1-planar if there exists a drawing in the plane so that each edge contains at most one crossing. We study maximal 1-planar graphs from the point of view of properties of their diagrams, local structure and hamiltonicity.

On some variations of extremal graph problems

Gabriel Semanišin (1997)

Discussiones Mathematicae Graph Theory

Similarity:

A set P of graphs is termed hereditary property if and only if it contains all subgraphs of any graph G belonging to P. A graph is said to be maximal with respect to a hereditary property P (shortly P-maximal) whenever it belongs to P and none of its proper supergraphs of the same order has the property P. A graph is P-extremal if it has a the maximum number of edges among all P-maximal graphs of given order. The number of its edges is denoted by ex(n, P). If the number of edges...