Hilfe beim Zugang
Haben Sie den VPN-Client gestartet bzw. sind Sie via Shibboleth angemeldet (weitere Informationen)?
1-Triangle graphs and perfect neighborhood sets
Abstract A graph is called a 1-triangle if, for its every maximal independent set I, every edge of this graph with both endvertices not belonging to I is contained exactly in one triangle with a vertex of I. We obtain a characterization of 1-triangle graphs which implies a polynomial time recognitio...
Ausführliche Beschreibung