Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
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.disc.2011.05.031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2145887270 / 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: Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture / 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: 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: Blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic cycle partitions of edge-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex partitions by connected monochromatic \(k\)-regular graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:10, 4 July 2024

scientific article
Language Label Description Also known as
English
Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs
scientific article

    Statements

    Identifiers