Planar graphs without 4-cycles adjacent to triangles are 4-choosable

Wang, Yingqian; Cheng, Panpan; Chen, Min Min

doi:10.1016/j.disc.2016.06.009

Record: found
Abstract: not found
Article: not found

Planar graphs without 4-cycles adjacent to triangles are 4-choosable

Author(s): Panpan Cheng , Min Chen , Yingqian Wang

Publication date Created: December 2016

Publication date (Print): December 2016

Journal: Discrete Mathematics

Publisher: Elsevier BV

Read this article at

ScienceOpenPublisher

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Journal

Title: Discrete Mathematics

Abbreviated Title: Discrete Mathematics

Publisher: Elsevier BV

ISSN (Print): 0012365X

Publication date Created: December 2016

Publication date (Print): December 2016

Volume: 339

Issue: 12

Pages: 3052-3057

Article

DOI: 10.1016/j.disc.2016.06.009

SO-VID: 2d1fe67d-9b03-4b52-909f-d735e4487b33

License:

http://www.elsevier.com/tdm/userlicense/1.0/

History

Data availability:

Planar graphs without 4-cycles adjacent to triangles are 4-choosable

Read this article at

Related collections

UCL: UN SDG 04 Quality Education

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 2,521

Cited by 6