m-partite subgraphs into which K_n can be decomposed.">m-partite subgraphs into which K_n can be decomposed., 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

"On the minimum number of edge-disjoint complete m-partite subgraphs ..."

Qing-Xue Huang (1993)

> Home

Details and statistics

DOI: 10.1002/JGT.3190170609

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/Huang93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Huang93
Qing-Xue Huang:
On the minimum number of edge-disjoint complete m-partite subgraphs into which K_n can be decomposed. J. Graph Theory 17(6): 727-754 (1993)

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.