Results 141 to 144 of about 161 (144)
Some of the next articles are maybe not open access.
Independent covers in outerplanar graphs
1988A subset U of vertices of a plane graph is said to be a perfect face-independent vertex cover (FIVC) if and only if each face has exactly one vertex in U. Necessary and sufficient conditions for a maximal plane graph to have a perfect FIVC are derived.
Maciej M. Syslo, Paweł Winter
openaire +1 more source
Linear algorithms to recognize outerplanar and maximal outerplanar graphs
Information Processing Letters, 1979openaire +2 more sources