Bounding the tripartite‐circle crossing number of complete tripartite graphs (Q6057580): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bishellable drawings of $K_n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-page crossing number of \(K_{n}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shellable drawings and the cylindrical crossing number of \(K_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bipartite-cylindrical crossing number of the complete bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number ofK1,3,n andK2,3,n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The early history of the brick factory problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5252027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Crossings in a Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing number is hard for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of <i>K</i><sub>11</sub> is 100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd crossing number and crossing number are not the same / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of P. Turan concerning graphs / rank
 
Normal rank

Latest revision as of 01:52, 3 August 2024

scientific article; zbMATH DE number 7746045
Language Label Description Also known as
English
Bounding the tripartite‐circle crossing number of complete tripartite graphs
scientific article; zbMATH DE number 7746045

    Statements

    Bounding the tripartite‐circle crossing number of complete tripartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 October 2023
    0 references
    3-circle drawing
    0 references
    circle drawing
    0 references
    complete tripartite graph
    0 references
    crossing number
    0 references
    Harary-Hill bound
    0 references

    Identifiers