A note on \(t\)-complementing permutations for graphs (Q990101): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q685595 / rank
Normal rank
 
Property / author
 
Property / author: Adam Paweł Wojda / 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.ipl.2009.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055944593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cyclically \(K\)-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-complementing permutations of cyclically \(k\)-complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The divisibility theorem for isomorphic factorizations of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selbstkomplementäre Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5730676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of \(K_n\) into subgraphs of prescribed type / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:25, 3 July 2024

scientific article
Language Label Description Also known as
English
A note on \(t\)-complementing permutations for graphs
scientific article

    Statements

    A note on \(t\)-complementing permutations for graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2010
    0 references
    self-complementary graph
    0 references
    self-complementing permutation
    0 references
    combinatorial problems
    0 references
    graph algorithms
    0 references

    Identifiers