Journal article
Bad news for chordal partitions
- Abstract:
- Reed and Seymour [1998] asked whether every graph has a partition into induced connected non-empty bipartite subgraphs such that the quotient graph is chordal. If true, this would have significant ramifications for Hadwiger’s Conjecture. We prove that the answer is ‘no’. In fact, we show that the answer is still ‘no’ for several relaxations of the question.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 105.2KB)
-
- Publisher copy:
- 10.1002/jgt.22363
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Funding
Office for Nuclear Regulation
More from this funder
Australian Research Council
More from this funder
National Science Foundation
More from this funder
Bibliographic Details
- Publisher:
- Wiley Publisher's website
- Journal:
- Journal of Graph Theory Journal website
- Volume:
- 90
- Issue:
- 5
- Pages:
- 5-12
- Publication date:
- 2018-06-12
- Acceptance date:
- 2018-03-31
- DOI:
- EISSN:
-
1097-0118
- ISSN:
-
0364-9024
- Source identifiers:
-
833232
Item Description
- Pubs id:
-
pubs:833232
- UUID:
-
uuid:ad8cf45a-a657-46e7-800e-c096c110226b
- Local pid:
- pubs:833232
- Deposit date:
- 2018-04-04
Terms of use
- Copyright holder:
- Wiley Periodicals Inc
- Copyright date:
- 2018
- Notes:
- © 2018 Wiley Periodicals, Inc. This is the accepted manuscript version of the article. The final version is available online from Wiley at: https://doi.org/10.1002/jgt.22363
If you are the owner of this record, you can report an update to it here: Report update to this record