Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture (Q965246): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2009.07.001 / rank
Normal rank
 
Property / author
 
Property / author: Stéphane Bessy / rank
Normal rank
 
Property / author
 
Property / author: Steéphan Thomassé / rank
Normal rank
 
Property / author
 
Property / author: Stéphane Bessy / rank
 
Normal rank
Property / author
 
Property / author: Steéphan Thomassé / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964859857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coverings by monochromatic cycles and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex coverings by monochromatic paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound for the monochromatic cycle partition number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning complete bipartite graphs by monochromatic cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2009.07.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:16, 10 December 2024

scientific article
Language Label Description Also known as
English
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
scientific article

    Statements

    Identifiers