licheng's profile - overview

● Famous Question   × 6

• Find all cycles in an undirected graph
• How to find a longest cycle and a longest induced cycle in a graph?
• Where is my sage?
• How to determine whether a graph has l cycles of length k exactly?
• sage.all is not available; this is a limited REPL.
• sagemath 9.0 and sagemath 9.3 on my computer crash

● Teacher   × 1

• Code to find separating set in SageMath of a given Graph

● Nice Answer   × 1

• Code to find separating set in SageMath of a given Graph

● Necromancer   × 1

• Code to find separating set in SageMath of a given Graph

● Supporter   × 1

• Find 25-vertex 4-regular planar graphs using plantri

● Good Answer   × 1

• Code to find separating set in SageMath of a given Graph

● Civic Duty   × 1

• How do I write function to test if a graph is apex?

● Enthusiast   × 1

● Commentator   × 1

• Is there code to identify a decomposition of the lexicographic product of a graph?

● Associate Editor   × 1

• plantri installation always fails

● Popular Question   × 29

• name 'Graph' is not defined
• How to specify dashed edges in SageMath?
• How to add edges while keeping the original graph unchanged
• Does Sage have a function to determine vertex cuts?
• The canonical labels in SageMath are different from those in nauty.
• subgraph_search_iterator gives duplicate subgraphs
• Calculate the toughness of a graph
• Find all cycles in an undirected graph
• How to see the source code of the function distance_graph
• How to determine there is a k-path between two vertices
• How to determine if two colorings of a graph are the same?
• How to determine whether a graph has l cycles of length k exactly?
• How to draw CubeGraph(5) better?
• List all connected subgraphs with exactly k vertices
• How to save a list of graphs into a graph6 format file?
• sage.all is not available; this is a limited REPL.
• How to find a longest cycle and a longest induced cycle in a graph?
• How to adjust the size of graphs in `graphs_list.show_graphs`
• Generate multigraphs with given underlying graph
• Why doesn't 'sage -n jupyterlab' open correctly ?(localhost refused to connect)
• Where is my sage?
• Finding all non-isomorphic $C_5$-free connected planar graphs of order 11.
• Can the bytes returned by pynauty's "certificate" function be converted into a graph format readable by Sage?
• How to solve the following system of inequalities
• Find all minimal edge cuts of a graph.
• sagemath 9.0 and sagemath 9.3 on my computer crash
• How to put the drawing of graphs in a matrix or list
• Find 25-vertex 4-regular planar graphs using plantri
• Is there a way to integrate sqrt(x+sqrt(x)) in Sage?

● Notable Question   × 17

• Why doesn't 'sage -n jupyterlab' open correctly ?(localhost refused to connect)
• How to determine there is a k-path between two vertices
• Where is my sage?
• How to solve the following system of inequalities
• How to determine whether a graph has l cycles of length k exactly?
• Finding all non-isomorphic $C_5$-free connected planar graphs of order 11.
• Find all cycles in an undirected graph
• How to save a list of graphs into a graph6 format file?
• Generate multigraphs with given underlying graph
• sage.all is not available; this is a limited REPL.
• How to find a longest cycle and a longest induced cycle in a graph?
• Can the bytes returned by pynauty's "certificate" function be converted into a graph format readable by Sage?
• Find all minimal edge cuts of a graph.
• Find 25-vertex 4-regular planar graphs using plantri
• Is there a way to integrate sqrt(x+sqrt(x)) in Sage?
• sagemath 9.0 and sagemath 9.3 on my computer crash
• How to put the drawing of graphs in a matrix or list

● Nice Question   × 3

• The canonical labels in SageMath are different from those in nauty.
• Find all cycles in an undirected graph
• Mysterious Disappearance of an edge

● Scholar   × 1

• Is there a way to integrate sqrt(x+sqrt(x)) in Sage?

● Editor   × 1

• How to put the drawing of graphs in a matrix or list

● Student   × 1

• Is there a way to integrate sqrt(x+sqrt(x)) in Sage?

● Citizen Patrol   × 1

• How to determine there is a k-path between two vertices