On 3-colorable plane graphs without 5- and 7-cycles (Q859619): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bao-Gang Xu / rank
Normal rank
 
Property / author
 
Property / author: Bao-Gang Xu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2006.02.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2784761478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs without cycles of length from 4 to 7 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for planar graphs to be 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-color theorem on plane graphs without 5-circuits / rank
 
Normal rank

Latest revision as of 12:38, 25 June 2024

scientific article
Language Label Description Also known as
English
On 3-colorable plane graphs without 5- and 7-cycles
scientific article

    Statements