C-4-saturated bipartite graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
268 | en_US |
dc.citation.issue |
1-3 | en_US |
dc.citation.spage |
263 | en_US |
dc.citation.volume |
259 | en_US |
dc.citation.woscount |
2 | |
dc.contributor.author |
Bryant, DE | en_US |
dc.contributor.author |
Fu, HL | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:41:37Z | |
dc.date.available |
2014-12-08T15:41:37Z | |
dc.date.issued |
2002-12-28 | en_US |
dc.description.abstract |
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgraph of K with the property that for any edge e is an element of E(K)E(G), G boolean OR {e} is not H-free. We present some general results on K-s,K-t-saturated subgraphs of the complete bipartite graph K-m,K-n and study the problem of finding, for all possible values of q, a C-4-saturated subgraph of K., having precisely q edges. (C) 2002 Elsevier Science B.V. All rights reserved. | en_US |
dc.identifier.issn |
0012-365X | en_US |
dc.identifier.journal |
DISCRETE MATHEMATICS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/28302 | |
dc.identifier.wosnumber |
WOS:000180085900019 | |
dc.language.iso |
en_US | en_US |
dc.title |
C-4-saturated bipartite graphs | en_US |
dc.type |
Article | en_US |
檔案
- 000180085900019.pdf (88.6 KB, Adobe PDF)
所屬典藏: 期刊論文