Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Find 25-vertex 4 regular planar graphs by using plantri.

I am using sagemath -9.2 and I have recently wanted to add the package "plantri" to my packages. I found a link to a similar question before. ( The link cannot be attached because:Could not post, because your karma is insufficient to publish links)

sage: !sage -i plantri

An error occurred during the installation process that prevented it from proceeding.

    make[3345]: Entering directory '/opt/sagemath-9.2'
      0 [main] make (45584) C:\Users\asus\AppData\Local\SageMath 9.2\runtime\bin
\make.exe: *** fatal error in forked process - ccalloc would have returned NULL 
      0 [main] make 15063 dofork: child -1 - forked process 45584 died unexpect
dly, retry 0, exit code 0xC0000142, errno 11
make[3345]: *** [Makefile:31: bootstrap] Error 127

My computer is windows10 64-bit system. I don't know how to solve this problem of installation.

In fact, the graph theory problem I encountered is as follows.

I 'd like to generate all 25-vertex 4 regular planar graphs that size of maximum face is 4. Of course it may not exist.

With the help of this computer software, I think there should be no problem, because I saw the following link, which contains such a paragraph.

Additionally, using plantri it has been established that there exist no 4-regular planar graphs with 28 vertices and similarly there are no 3-regular planar graphs with diameter 4 with between 20 and 30 vertices.

(faculty.capebretonu.ca/jpreen/degdiam.html)

If there is someone who has successfully installed it, can you help me see if there is such a graph? Thanks in advance!

Find 25-vertex 4 regular planar graphs by using plantri.

I am using sagemath -9.2 and I have recently wanted to add the package "plantri" to my packages. I found a link to a similar question before. ( The link cannot be attached because:Could not post, because your karma is insufficient to publish links)

sage: !sage -i plantri

An error occurred during the installation process that prevented it from proceeding.

    make[3345]: Entering directory '/opt/sagemath-9.2'
      0 [main] make (45584) C:\Users\asus\AppData\Local\SageMath 9.2\runtime\bin
\make.exe: *** fatal error in forked process - ccalloc would have returned NULL 
      0 [main] make 15063 dofork: child -1 - forked process 45584 died unexpect
dly, retry 0, exit code 0xC0000142, errno 11
make[3345]: *** [Makefile:31: bootstrap] Error 127

My computer is windows10 64-bit system. I don't know how to solve this problem of installation.

In fact, the graph theory problem I encountered is as follows.

I 'd like to generate all 25-vertex 4 regular planar graphs that size of maximum face is 4. Of course it may not exist.

With the help of this computer software, plantri, I think there should be no problem, because I saw the following link, which contains such a paragraph.

Additionally, using plantri it has been established that there exist no 4-regular planar graphs with 28 vertices and similarly there are no 3-regular planar graphs with diameter 4 with between 20 and 30 vertices.

(faculty.capebretonu.ca/jpreen/degdiam.html)

If there is someone who has successfully installed it, can you help me see if there is such a graph? Thanks in advance!

Find 25-vertex 4 regular planar graphs by using plantri.

I am using sagemath -9.2 and I have recently wanted to add the package "plantri" to my packages. I found a link to a similar question before. ( The link cannot be attached because:Could not post, because your karma is insufficient to publish links)

sage: !sage -i plantri

An error occurred during the installation process that prevented it from proceeding.

    make[3345]: Entering directory '/opt/sagemath-9.2'
      0 [main] make (45584) C:\Users\asus\AppData\Local\SageMath 9.2\runtime\bin
\make.exe: *** fatal error in forked process - ccalloc would have returned NULL 
      0 [main] make 15063 dofork: child -1 - forked process 45584 died unexpect
dly, retry 0, exit code 0xC0000142, errno 11
make[3345]: *** [Makefile:31: bootstrap] Error 127

My computer is windows10 64-bit system. I don't know how to solve this problem of installation.

In fact, the graph theory problem I encountered is as follows.

I 'd like to generate all 25-vertex 4 regular planar graphs that size of maximum face is 4. Of course it may not exist.

With the help of plantri, I think there should be no problem, because I saw the following link, which contains such a paragraph.

Additionally, using plantri it has been established that there exist no 4-regular planar graphs with 28 vertices and similarly there are no 3-regular planar graphs with diameter 4 with between 20 and 30 vertices.

(faculty.capebretonu.ca/jpreen/degdiam.html)

If there is someone who has successfully installed it, can you help me see if there is such a graph? Thanks in advance!

sage: for G in graphs.planar_graphs(25, minimum_degree=4):
....:     if G.num_edges==50:
sage:        show(G)
sage: print("nofind")

Find 25-vertex 4 regular planar graphs by using plantri.

I am using sagemath -9.2 and I have recently wanted to add the package "plantri" to my packages. I found a link to a similar question before. ( The link cannot be attached because:Could not post, because your karma is insufficient to publish links)

sage: !sage -i plantri

An error occurred during the installation process that prevented it from proceeding.

    make[3345]: Entering directory '/opt/sagemath-9.2'
      0 [main] make (45584) C:\Users\asus\AppData\Local\SageMath 9.2\runtime\bin
\make.exe: *** fatal error in forked process - ccalloc would have returned NULL 
      0 [main] make 15063 dofork: child -1 - forked process 45584 died unexpect
dly, retry 0, exit code 0xC0000142, errno 11
make[3345]: *** [Makefile:31: bootstrap] Error 127

My computer is windows10 64-bit system. I don't know how to solve this problem of installation.

In fact, the graph theory problem I encountered is as follows.

I 'd like to generate all 25-vertex 4 regular planar graphs that size of maximum face is 4. Of course it may not exist.

With the help of plantri, I think there should be no problem, because I saw the following link, which contains such a paragraph.

Additionally, using plantri it has been established that there exist no 4-regular planar graphs with 28 vertices and similarly there are no 3-regular planar graphs with diameter 4 with between 20 and 30 vertices.

(faculty.capebretonu.ca/jpreen/degdiam.html)

If there is someone who has successfully installed it, can you help me see if there is such a graph? Thanks in advance!

sage: for G in graphs.planar_graphs(25, minimum_degree=4):
....:     if G.num_edges==50:
sage:        show(G)
sage: print("nofind")

The above codes may need improvement

Find 25-vertex 4 regular planar graphs by using plantri.

I am using sagemath -9.2 and I have recently wanted to add the package "plantri" to my packages. I found a link to a similar question before. ( The link cannot be attached because:Could not post, because your karma is insufficient to publish links)

sage: !sage -i plantri

An error occurred during the installation process that prevented it from proceeding.

    make[3345]: Entering directory '/opt/sagemath-9.2'
      0 [main] make (45584) C:\Users\asus\AppData\Local\SageMath 9.2\runtime\bin
\make.exe: *** fatal error in forked process - ccalloc would have returned NULL 
      0 [main] make 15063 dofork: child -1 - forked process 45584 died unexpect
dly, retry 0, exit code 0xC0000142, errno 11
make[3345]: *** [Makefile:31: bootstrap] Error 127

My computer is windows10 64-bit system. I don't know how to solve this problem of installation.

In fact, the graph theory problem I encountered is as follows.

I 'd like to generate all 25-vertex 4 regular planar graphs that size of maximum face is 4. Of course it may not exist.

With the help of plantri, I think there should be no problem, because I saw the following link, which contains such a paragraph.

Additionally, using plantri it has been established that there exist no 4-regular planar graphs with 28 vertices and similarly there are no 3-regular planar graphs with diameter 4 with between 20 and 30 vertices.

(faculty.capebretonu.ca/jpreen/degdiam.html)

If there is someone who has successfully installed it, can you help me see if there is such a graph? Thanks in advance!

sage: for G in graphs.planar_graphs(25, minimum_degree=4):
....:     if G.num_edges==50:
sage:        show(G)
sage: print("nofind")

The above codes may need improvement

Find 25-vertex 4 regular planar graphs by using plantri.

I am using sagemath -9.2 and I have recently wanted to add the package "plantri" to my packages. I found a link to a similar question before. ( The link cannot be attached because:Could not post, because your karma is insufficient to publish links)

sage: !sage -i plantri

An error occurred during the installation process that prevented it from proceeding.

    make[3345]: Entering directory '/opt/sagemath-9.2'
      0 [main] make (45584) C:\Users\asus\AppData\Local\SageMath 9.2\runtime\bin
\make.exe: *** fatal error in forked process - ccalloc would have returned NULL 
      0 [main] make 15063 dofork: child -1 - forked process 45584 died unexpect
dly, retry 0, exit code 0xC0000142, errno 11
make[3345]: *** [Makefile:31: bootstrap] Error 127

My computer is windows10 64-bit system. I don't know how to solve this problem of installation.

In fact, the graph theory problem I encountered is as follows.

I 'd like to generate all 25-vertex 4 regular planar graphs that size of maximum face is 4. Of course it may not exist.

With the help of plantri, I think there should be no problem, because I saw the following link, which contains such a paragraph.

Additionally, using plantri it has been established that there exist no 4-regular planar graphs with 28 vertices and similarly there are no 3-regular planar graphs with diameter 4 with between 20 and 30 vertices.

(faculty.capebretonu.ca/jpreen/degdiam.html)

If there is someone who has successfully installed it, can you help me see if there is such a graph? Thanks in advance!

sage: for G in graphs.planar_graphs(25, minimum_degree=4):
....:     if G.num_edges==50:
sage:        show(G)
sage: print("nofind")

The above codes may need improvement

Find 25-vertex 4 regular 4-regular planar graphs by using plantri.plantri

I am using sagemath -9.2 SageMath 9.2 and I have recently wanted to add the optional package "plantri" to my packages. . I found a link to a similar question before. ( The link cannot be attached because:Could not post, because your karma is insufficient to publish links)before: Ask Sage question 52358 where a comment suggests this command:

sage: !sage -i plantri

An error occurred during the installation process that prevented it from proceeding.

    make[3345]: Entering directory '/opt/sagemath-9.2'
      0 [main] make (45584) C:\Users\asus\AppData\Local\SageMath 9.2\runtime\bin
\make.exe: *** fatal error in forked process - ccalloc would have returned NULL 
      0 [main] make 15063 dofork: child -1 - forked process 45584 died unexpect
dly, retry 0, exit code 0xC0000142, errno 11
make[3345]: *** [Makefile:31: bootstrap] Error 127

My computer is windows10 runs the Windows10 64-bit system. operating system. I don't know how to solve this problem of installation.installation problem.

In fact, the graph theory problem I encountered is as follows.

I 'd like to generate all 25-vertex 4 regular planar graphs that size of maximum face is 4. Of course it may not exist.

With the help of plantri, I think there should be no problem, problem, because I saw the following link, James Preen's page on the degree-diameter problem, which contains such a the following paragraph.

Additionally, using plantri it has been established that there exist exist no 4-regular planar graphs with 28 vertices and similarly similarly there are no no 3-regular planar graphs with diameter diameter 4 with with between 20 and 30 vertices.

(faculty.capebretonu.ca/jpreen/degdiam.html)

If there is someone who has successfully installed it, can you help me see if there is such a graph? graph?

Thanks in advance!

sage: for G in graphs.planar_graphs(25, minimum_degree=4):
....:     if G.num_edges==50:
sage:        show(G)
sage: print("nofind")

The above codes may need improvementimprovement.