Vertex partitions by connected monochromatic \(k\)-regular graphs (Q1569063): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jctb.1999.1933 / 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.1006/jctb.1999.1933 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075905937 / 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: Q3977492 / 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: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blow-up lemma / 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: Dense graphs without 3-regular subgraphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCTB.1999.1933 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:43, 10 December 2024

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

    Statements

    Identifiers