A Characterization of Forcibly Tripartite Self-Complementary class of Partitioned Sequences (Q3439026): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Enumeration of bipartite self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree sequences of self-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisation of potentially bipartite self-complementary bipartitioned sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Linear, Directed, Rooted, and Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of bi-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Locally Restricted Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power group enumeration theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of Graphs with Given Partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5598930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3956991 / rank
 
Normal rank

Revision as of 20:05, 25 June 2024

scientific article
Language Label Description Also known as
English
A Characterization of Forcibly Tripartite Self-Complementary class of Partitioned Sequences
scientific article

    Statements

    A Characterization of Forcibly Tripartite Self-Complementary class of Partitioned Sequences (English)
    0 references
    0 references
    29 May 2007
    0 references
    0 references
    chromatically non-isomorphic bipartite self-complementary graphs
    0 references