Irreducible coverings by cliques and Sperner's theorem.
Tomescu, Ioan (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A remark on systems of maximal cliques of a graph”
Irreducible coverings by cliques and Sperner's theorem.
The Hadwiger number of complements of some graphs
Jaroslav Ivančo (1997)
Mathematica Slovaca
Similarity:
Finding a spanning tree of a graph with maximal number of terminal vertices
Bohdan Zelinka (1973)
Kybernetika
Similarity:
Sequences of Maximal Degree Vertices in Graphs
Khadzhiivanov, Nickolay, Nenov, Nedyalko (2004)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: 05C35. Let Γ(M ) where M ⊂ V (G) be the set of all vertices of the graph G adjacent to any vertex of M. If v1, . . . , vr is a vertex sequence in G such that Γ(v1, . . . , vr ) = ∅ and vi is a maximal degree vertex in Γ(v1, . . . , vi−1), we prove that e(G) ≤ e(K(p1, . . . , pr)) where K(p1, . . . , pr ) is the complete r-partite graph with pi = |Γ(v1, . . . , vi−1) Γ(vi )|.