Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime (Q658020): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q56990570 / 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.disc.2011.03.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012965298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subgraphs of Cartesian product graphs and S-primeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local prime factor decomposition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subgraphs of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing subgraphs of Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new concept of primeness in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065584 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:29, 4 July 2024

scientific article
Language Label Description Also known as
English
Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime
scientific article

    Statements

    Diagonalized Cartesian products of \(S\)-prime graphs are \(S\)-prime (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2012
    0 references
    0 references
    Cartesian product graph
    0 references
    nontrivial path-\(k\)-coloring
    0 references
    0 references
    0 references