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

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

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitlePaths in circuit graphs of matroids
JournalTheoretical Computer Science
AuthorsLiu, GuizhenAuthor
Li, PingAuthor
Year2008 (May)Volume396
Issue1
PublisherElsevier BV
DOIdoi:10.1016/j.tcs.2008.01.033Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID6544034Long-form Identifiermindat:1:5:6544034:4
GUID0
Full ReferenceLiu, 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
Plain TextLiu, 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
In(2008) Theoretical Computer Science Vol. 396. Elsevier BV

See Also

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

Li, Ping, Liu, Guizhen (2008) Hamilton cycles in circuit graphs of matroids. Computers & Mathematics with Applications, 55. 654-659 doi:10.1016/j.camwa.2007.04.039
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
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
Kosowski, Adrian (2008) The maximum edge-disjoint paths problem in complete graphs. Theoretical Computer Science, 399 (1). 128-140 doi:10.1016/j.tcs.2008.02.017
Zhang, Zhao, Li, Hao (2007) Algorithms for long paths in graphs. Theoretical Computer Science, 377 (1). 25-34 doi:10.1016/j.tcs.2007.02.012
Verbitsky, Oleg (2008) On the obfuscation complexity of planar graphs. Theoretical Computer Science, 396 (1). 294-300 doi:10.1016/j.tcs.2008.02.032
Li, Xueliang, Zhou, Wenli (2008) The 2nd-order conditional 3-coloring of claw-free graphs. Theoretical Computer Science, 396 (1). 151-157 doi:10.1016/j.tcs.2008.01.034
Myung, Young-Soo (2008) On the clique partitioning problem in weighted interval graphs. Theoretical Computer Science, 396 (1). 290-293 doi:10.1016/j.tcs.2008.02.016
Wang, Huijuan, Liu, Bin, Wu, Jianliang, Liu, Guizhen (2014) Total coloring of embedded graphs with maximum degree at least seven. Theoretical Computer Science, 518. 1-9 doi:10.1016/j.tcs.2013.04.030
Gong, Ye, Gu, Qian-Ping (2022) An efficient oracle for counting shortest paths in planar graphs. Theoretical Computer Science, 921. 75-85 doi:10.1016/j.tcs.2022.04.002
Yuster, Raphael (2008) All-pairs disjoint paths from a common ancestor in Õ(nω) time. Theoretical Computer Science, 396 (1). 145-150 doi:10.1016/j.tcs.2008.01.032
 
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: August 25, 2025 13:50:51
Go to top of page