Titlebook: Combinatorial Algorithms; 23rd International W S. Arumugam,W. F. Smyth Conference proceedings 2012 Springer-Verlag Berlin Heidelberg 2012 a

手段

辩论

Sedative

因无茶而冷淡

Moderate

Bounds on Quasi-Completeness,A graph . = (.,.) is .-quasi-complete (. ∈ [0,1]) if every vertex in . is connected to at least ..(|.| − 1) other vertices. In this paper, we establish some relationships between the girth and the quasi-completeness of a graph. We also derive an upper bound . for the largest order .-quasi-complete subgraph in a graph of minimum degree ..

Exposure

Maximum Order of a Planar Oclique Is 15,An oclique is an oriented graph where every pair of distinct non-adjacent vertices are connected by a directed path of length 2. Klostermeyer and MacGillivray conjectured that the maximum order of a planar oclique is 15. In this article we settle that conjecture.

GUILE

HPA533

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229889.jpg

admission

误传