مرکز منطقه ای اطلاع رساني علوم و فناوري - Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

Title of article :

Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

Author/Authors :

Zhi-Zhong Chen، نويسنده , , Shiqing Zhang، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2002

Pages :

From page :

141

To page :

145

Keywords :

Algorithms , Bipartite graphs , Edge bound

Journal title :

Information Processing Letters

Serial Year :

2002

Journal title :

Information Processing Letters

Record number :

129601

Link To Document :