Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Every 2-choosable graph is (2m, m)-choosable
Home
Publications
Every 2-choosable graph is (2m, m)-choosable
Every 2-choosable graph is (2m, m)-choosable
Authors:
ZT
Zs. Tuza
Zs. Tuza
MV
M. Voigt
M. Voigt
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 July 1996
journal article
research article
Published by
Wiley
in
Journal of Graph Theory
Vol. 22
(3)
,
245-252
DOI:
10.1002/(sici)1097-0118(199607)22:3<245::aid-jgt5>3.0.co;2-m
Abstract
No abstract available
Keywords
CARDINALITY
VERTEX
SONS
RUBIN
CHOOSABLE GRAPH
ERDÖS
Cited
Cited by 27 articles
Scroll to top