ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
1
views
0
references
Top references
cited by
1
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,840
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
A Note on Group Choosability of Graphs with Girth at least 4
Author(s):
G. R. OMIDI
Publication date:
2011
Journal:
Graphs and Combinatorics
Read this article at
ScienceOpen
Publisher
Further versions
Bookmark
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
Emerald Publishing
Author and article information
Journal
DOI::
10.1007/s00373-010-0971-4
Data availability:
Comments
Comment on this article
Sign in to comment
Related Documents Log
scite_
Similar content
1,840
Choosability with separation of planar graphs without prescribed cycles
Authors:
Min Min Chen
,
Yingying Fan
,
André Raspaud
…
A refinement of choosability of graphs
Authors:
Xuding Zhu
Planar graphs without 4-cycles adjacent to triangles are 4-choosable
Authors:
Yingqian Wang
,
Panpan Cheng
,
Min Min Chen
See all similar
Cited by
1
A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles
Authors:
Amir Khamseh
,
Andrei V. Kelarev
See all cited by