Some constructions of 3-minimal graphs with cycles

Some constructions of 3-minimal graphs with cycles

Visa alla versioner (2)

Prime graphs with triangles ? namely (a) P_k∪{i(i+2)} with k≥5 and 2≤i≤k-3, (b) Q_k with k≥5, and (c) S_(k,m,n) with an additional edge to form a triangle ? were constructed and shown 3-minimal for some vertex-subsets. If G has a triangle and is 3-minimal for a nonstable subset X of V(G), it was sho...

Full beskrivning

Bibliografiska uppgifter
Huvudupphovsmän: Factolerin, Wielson M. (Författare, medförfattare), Loyola, Jean O. (Författare, medförfattare)
Materialtyp: Analytics
Språk:English
Publicerad: 2020.
Ämnen:
Mathematics.
Graphs.
Indecomposable.
#119896-minimal.
Minimal.
Prime.
Länkar:https://forms.gle/KZjBv7aRtY6jiL5E9