Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
RSS
Sort by »
relevance ▼
date
activity
answers
votes
1031
questions
Tagged
542
views
1
answer
1
vote
2024-03-11 11:33:22 +0200
rburing
How to add edges while keeping the original graph unchanged
graphtheory
2k
views
1
answer
2
votes
2014-01-13 16:24:41 +0200
niles
Embedding a graphics/plot on a torus
graph
3dplot
3dplotting
embedding
2k
views
3
answers
1
vote
2012-03-01 15:00:34 +0200
Nathann
Memory blowup with MILP
graph_theory
linear_programming
1k
views
1
answer
1
vote
2020-04-16 07:45:14 +0200
slelievre
Define a graph
1k
views
1
answer
1
vote
2019-05-21 12:38:47 +0200
slelievre
Maximum algebraic connectivity from a given collection of graphs
749
views
2
answers
no
votes
2013-03-28 13:53:52 +0200
tmonteil
code for bipartite graphs
digraph
632
views
1
answer
no
votes
2024-03-04 06:27:29 +0200
licheng
Calculate the toughness of a graph
graphtheory
657
views
1
answer
2
votes
2012-09-21 14:19:11 +0200
G-Sage
Minor improvement to chromatic number
graph_theory
1k
views
3
answers
1
vote
2012-01-25 06:30:09 +0200
Nathann
Bug in Graph.girth in 4.7.2 ?
graph_theory
sage-4.7
fixed_issue
1k
views
2
answers
2
votes
2022-03-04 16:56:12 +0200
slelievre
Code to find separating set in SageMath of a given Graph
permutation
591
views
1
answer
1
vote
2015-10-26 10:40:41 +0200
stan
Unable to simplify function output
box
graph
simplify
real
394
views
1
answer
1
vote
2023-01-31 19:02:11 +0200
Max Alekseyev
Generate the list of all graph isomorphism classes of a given size n
649
views
no
answers
1
vote
2024-04-21 03:43:18 +0200
licheng
Generate all connected graphs of order 12 with matching number of 4
graphtheory
1k
views
2
answers
2
votes
2017-12-13 21:56:43 +0200
ctst
find embedded subgraphs
digraph
graph
1k
views
1
answer
no
votes
2016-06-30 12:03:45 +0200
Mehmet Akif Yetim
How to convert (some particular) Sage objects into Macaulay2 ones
Macaulay2
graph
ideal
16k
views
1
answer
1
vote
2025-08-09 18:18:57 +0200
David Coudert
Algorithm for listing minimal directed cuts and minimal dijoins
directed-graphs
algorithm
1k
views
3
answers
2
votes
2022-04-18 19:05:27 +0200
David Coudert
Finding all digraphs up to isomorphism for a given undirected graph using Sage
digraph
963
views
no
answers
no
votes
2022-12-25 02:59:15 +0200
licheng
Find all minimal edge cuts of a graph.
graphtheory
591
views
1
answer
no
votes
2022-08-31 23:21:09 +0200
tmonteil
The function crossing_number runs too slowly?
graphtheory
graphs
929
views
1
answer
1
vote
2019-06-10 18:19:54 +0200
slelievre
Obtaining all connected simply laced graphs with Sage for GAP
graphs
quivers
gap
1k
views
1
answer
3
votes
2016-10-03 23:01:15 +0200
tmonteil
How do I implement plantri in sagemath
planar-graph
1k
views
2
answers
1
vote
2022-10-16 22:46:38 +0200
tmonteil
Finding all non-isomorphic $C_5$-free connected planar graphs of order 11.
graphtheory
graph_generation
338
views
no
answers
1
vote
2022-07-17 09:50:39 +0200
dan_fulea
Is there code to identify a decomposition of the lexicographic product of a graph?
graphtheory
876
views
2
answers
3
votes
2022-04-28 09:01:48 +0200
vidyarthi
Constructing total graph
graphtheory
combinatorics
592
views
no
answers
no
votes
2021-04-22 17:22:17 +0200
ThemePark
How to combine bin packing with graph theory?
binpacking
graphtheory
504
views
1
answer
no
votes
2024-02-20 18:37:32 +0200
Max Alekseyev
How to determine if two colorings of a graph are the same?
graphtheory
911
views
1
answer
no
votes
2024-06-10 14:52:09 +0200
eric_g
name 'Graph' is not defined
graphtheory
525
views
2
answers
no
votes
2025-02-24 16:47:15 +0200
Sébastien
Test if a graph has a claw-decomposition
graphtheory
2k
views
no
answers
1
vote
2019-07-14 11:16:28 +0200
elastica
Boost implementation of Dijkstra's algorithm
graphs
boost
dijkstra
shortestpath
897
views
no
answers
no
votes
2024-07-25 21:13:14 +0200
Hisham Bhatti
Is there a way to get the Tait graph from a knot diagram? [closed]
knots
ask-sage
snappy
knot-theory
laplacian
« previous
1
...
16
17
18
19
20
...
35
next page »
Contributors
Tags
graphtheory
×12
graph
×4
digraph
×3
graphs
×3
graph_theory
×3
3dplot
×1
3dplotting
×1
algorithm
×1
ask-sage
×1
binpacking
×1
boost
×1
box
×1
combinatorics
×1
dijkstra
×1
directed-graphs
×1
embedding
×1
fixed_issue
×1
gap
×1
graph_generation
×1
ideal
×1
knots
×1
knot-theory
×1
laplacian
×1
linear_programming
×1
Macaulay2
×1
permutation
×1
planar-graph
×1
quivers
×1
real
×1
sage-4.7
×1
shortestpath
×1
simplify
×1
snappy
×1
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a
Creative Commons Attribution Share Alike 3.0
license.
Powered by Askbot version 0.7.59
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how
dummy
×