3, 3-free or K₅-free graph with an application.">3, 3-free or K₅-free graph with an application., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"Tight upper bound on the number of edges in a bipartite K3, ..."

Zhi-Zhong Chen, Shiqing Zhang (2002)

> Home

Details and statistics

DOI: 10.1016/S0020-0190(02)00268-5

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/ChenZ02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/ChenZ02
Zhi-Zhong Chen, Shiqing Zhang:
Tight upper bound on the number of edges in a bipartite K_{3, 3}-free or K₅-free graph with an application. Inf. Process. Lett. 84(3): 141-145 (2002)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.