On graphs isomorphic to their neighbour and non-neighbour sets (Q976164): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2009.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987809460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3558637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5265408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research problems from the 18th British Combinatorial Conference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal graphs and universal functions / rank
 
Normal rank

Latest revision as of 22:57, 2 July 2024

scientific article
Language Label Description Also known as
English
On graphs isomorphic to their neighbour and non-neighbour sets
scientific article

    Statements

    On graphs isomorphic to their neighbour and non-neighbour sets (English)
    0 references
    17 June 2010
    0 references
    0 references
    construction of a universal countable graph
    0 references
    0 references