Digraphs/gap/crossing-number.gd at fffdc1322ce3a6e4b437fefe549fe28a839da561 · digraphs/Digraphs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
# Properties
DeclareProperty("IsSemicompleteDigraph", IsDigraph);
DeclareProperty("IsCubicDigraph", IsDigraph);

# Operations
DeclareOperation("DigraphAddVertexCrossingPoint", [IsDigraph, IsList, IsList]);

# Global Functions
DeclareGlobalFunction("DigraphCrossingNumberUpperBound");
DeclareGlobalFunction("DigraphCrossingNumberLowerBound");
DeclareGlobalFunction("DIGRAPHS_CrossingNumberInequality");
DeclareGlobalFunction("DIGRAPHS_GetCompleteDigraphCrossingNumber");
DeclareGlobalFunction("DIGRAPHS_CrossingNumberAlbertson");
DeclareGlobalFunction("DIGRAPHS_CrossingNumberRound");
DeclareGlobalFunction("DIGRAPHS_IsK22FreeDigraph");
DeclareGlobalFunction("DIGRAPHS_ZarankiewiczTheorem");
DeclareGlobalFunction("DIGRAPHS_CompleteTripartiteDigraphCrossingNumber");
DeclareGlobalFunction("DIGRAPHS_Complete6partiteDigraphCrossingNumber");
DeclareGlobalFunction("DIGRAPHS_Complete5partiteDigraphCrossingNumber");
DeclareGlobalFunction("DIGRAPHS_Complete4partiteDigraphCrossingNumber");
DeclareGlobalFunction("DIGRAPHS_IsomorphicToCirculantGraphCrossingNumber");

# Attributes
DeclareAttribute("DIGRAPHS_CompleteDigraphCrossingNumber", IsCompleteDigraph);
DeclareAttribute("DIGRAPHS_TournamentCrossingNumber", IsTournament);
DeclareAttribute("DigraphCrossingNumber", IsDigraph);
DeclareAttribute("SemicompleteDigraphCrossingNumber", IsSemicompleteDigraph);
DeclareAttribute("DigraphAllThreeCycles", IsDigraph);
DeclareAttribute("DigraphAllTriangles", IsDigraph);
DeclareAttribute("DigraphLargePlanarSubdigraph", IsDigraph);
DeclareAttribute("DIGRAPHS_CompleteMultipartiteDigraphCrossingNumber",
                IsCompleteMultipartiteDigraph);
DeclareAttribute("DIGRAPHS_CompleteBipartiteDigraphCrossingNumber",
                IsCompleteBipartiteDigraph);
DeclareAttribute("CompleteMultipartiteDigraphPartitionSize",
                IsCompleteMultipartiteDigraph);