Vote for your favorite mineral in #MinCup25! - Carpathite vs. Leucite
Brace for oddness in a match between one of the very few hydrocarbon minerals carpathite and the temperature-flipping mineral leucite.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Wang, Guanghui, Liu, Guizhen (2009) Paths, cycles and circular colorings in digraphs. Theoretical Computer Science, 410 (21). 1982-1985 doi:10.1016/j.tcs.2008.12.014

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitlePaths, cycles and circular colorings in digraphs
JournalTheoretical Computer Science
AuthorsWang, GuanghuiAuthor
Liu, GuizhenAuthor
Year2009 (May)Volume410
Issue21
PublisherElsevier BV
DOIdoi:10.1016/j.tcs.2008.12.014Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID6544501Long-form Identifiermindat:1:5:6544501:1
GUID0
Full ReferenceWang, Guanghui, Liu, Guizhen (2009) Paths, cycles and circular colorings in digraphs. Theoretical Computer Science, 410 (21). 1982-1985 doi:10.1016/j.tcs.2008.12.014
Plain TextWang, Guanghui, Liu, Guizhen (2009) Paths, cycles and circular colorings in digraphs. Theoretical Computer Science, 410 (21). 1982-1985 doi:10.1016/j.tcs.2008.12.014
In(2009) Theoretical Computer Science Vol. 410. Elsevier BV

See Also

These are possibly similar items as determined by title/reference text matching only.

Bang-Jensen, Jørgen, Kriesell, Matthias (2009) Disjoint directed and undirected paths and cycles in digraphs. Theoretical Computer Science, 410 (47). 5138-5144 doi:10.1016/j.tcs.2009.08.034
Hou, Jianfeng, Liu, Guizhen, Cai, Jiansheng (2006) List edge and list total colorings of planar graphs without 4-cycles. Theoretical Computer Science, 369 (1). 250-255 doi:10.1016/j.tcs.2006.08.043
Cherubini, A., Kisielewicz, A. (2009) Collapsing words, permutation conditions and coherent colorings of trees. Theoretical Computer Science, 410 (21). 2135-2147 doi:10.1016/j.tcs.2009.01.038
Guignard, Adrien, Sopena, Éric (2009) Compound Node–Kayles on paths. Theoretical Computer Science, 410 (21). 2033-2044 doi:10.1016/j.tcs.2008.12.053
Liu, Guizhen, Li, Ping (2008) Paths in circuit graphs of matroids. Theoretical Computer Science, 396 (1). 258-263 doi:10.1016/j.tcs.2008.01.033
Nakprasit, Keaitsuda, Nakprasit, Kittikorn (2012) Equitable colorings of planar graphs without short cycles. Theoretical Computer Science, 465. 21-27 doi:10.1016/j.tcs.2012.09.014
Zhu, Junlei, Bu, Yuehua (2008) Equitable list colorings of planar graphs without short cycles. Theoretical Computer Science, 407 (1). 21-28 doi:10.1016/j.tcs.2008.04.018
Yu, Dongxiao, Hou, Jianfeng, Liu, Guizhen, Liu, Bin, Xu, Lan (2009) Acyclic edge coloring of planar graphs with large girth. Theoretical Computer Science, 410 (47). 5196-5200 doi:10.1016/j.tcs.2009.08.015
Ma, Meijie, Liu, Guizhen, Xu, Jun-Ming (2008) Fault-tolerant embedding of paths in crossed cubes. Theoretical Computer Science, 407 (1). 110-116 doi:10.1016/j.tcs.2008.05.002
Ding, Wei, Qiu, Ke (2017) Incremental single-source shortest paths in digraphs with arbitrary positive arc weights. Theoretical Computer Science, 674. 16-31 doi:10.1016/j.tcs.2017.02.007
Spoerhase, J., Wirth, H.-C. (2009) (r,p)-centroid problems on paths and trees. Theoretical Computer Science, 410 (47). 5128-5137 doi:10.1016/j.tcs.2009.08.020
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 6, 2025 11:32:43
Go to top of page