    
Graph methods

Graph.merge_vertices  #7159   renaming predecessor/successor to neighbors_out/in  #7157  
Counting spanning trees  #7184   Average distance, Wiener Index, Szeged index  #7314  
Strong orientations of 2connected graphs  #7358   Eulerian orientation of a graph  #7364  
Petersen's 2factor theorem  #7365   shortest_path should not use NetworkX  #7640  
implement Dijkstra's algorithm for C graphs  #7673   Max Vertex/Edge disjoint stpaths  #7292  
BFS/DFS and basic connectivity for c_graphs  #7724   Inconsistency in block_and_cut_vertices  #7853  
strongly_connected_components in c_graphs  #7671   speed up edge_connectivity in easy cases  #7854  
Giving some punch to distance computations  #7966   GomoryHu Trees  #7288  
induced subgraph search  #8922   Subdivide edges in a graph  #7378  
Interval Graphs : recognition  #7563   is_gallai_tree  #7904  
Overfull graph (and a bug in edge_coloring)  #8781   is_triangle_free  #8927  
some shortcuts for "is_Hfree" tests  #9059   Recognition of split graphs  #9195  
Perfect graph recognition algorithm  #8953   Computing the kcore of a graph  #9058  
Slightly improving is_forest  #9422   is_line_graph() method  #10101  
Update is_chordal to return certificates  #7662   bounded outdegree orientation  #9546  
FloydWarshall algorithm in Cython  #10885   shortest path all pairs through BFS computations.  #10905  
random_vertex and random_edge functions  #7569   Expose max_weight_matching from NetworkX  #8166  
Python max flow method  #9350   SubgraphSearch class instead of a method, digraphs fixed  #9420  
is_directed_acyclic is Cython+certificates  #10432   improving shortest path all pairs through BFS computations  #11053  
Expose weight options in distance method  #10954   Vertex separation and pathwidth in Sage  #11994  
Some distance computations remained slow  #12052   Slow computation of strongly connected components  #12235  
Static sparse graphs for fast lowlevel computations  #12306   Computation of rankdecompositions in Sage  #11754  
DegreeSequences class !  #11584   ISGCI in Sage  #11880  
Inconcistencies in the doc of TSP  #12944   Recognition of Comparability/Permutation graphs  #12874  
Speedup in strongly_connected_components  #12933   is_cartesian_product  #12917  
is_strongly_regular  #13067   Export a graph to a dictionary  #13785  
has_homomorphism_to  #13691   Small change to graph_is_strongly_regular  #13510  
Improve the is_vertex_transitive test  #13984   Speedup in GenericGraph.relabel() and two new options  #14000  
Recognition of circulant graphs  #14250   A certificate for is_forest  #14435  
Compute the root graph of a graph (inverse line_graph)  #13961   Update Nauty/Traces to 2.5.rc2  #14475  
Implement feedback_vertex_set for graphs  #14434   Adds sage.graphs.base.graph_backend to the doc  #14805  
Feedback_vertex_set for graphs  #14434   Graph.is_distance_regular  #14619  
Rename Graph.trace_faces to Graph.faces  #15551   Exceptions when multiedges/loops are not supported  #15572  
immutable=True for__init__ and copy()  #15603   Pickling of immutable graphs  #15619  
binary matrices, dense graphs, and is_strongly_regular  #14589   Teach the graph backend that 'yield' exists in Cython  #15715  
IndependentSets class  #13917   Waste of time in g.edges()  #15978  
Waste of time in iterator_edges 2  #16005   Stupid waste of time in graphs 1  #15704  
Graph drawing in javascript using d3.js  #14953   OA(k,n) strongly regular graphs  #16370  
Treewidth (lazy implementation)  #15181   Exact computations for fractional_chromatic_index  #16096  
Speed improvement for DiGraph.in_degree  #17163   Graph built from their edges are simple by default  #15706  
Faster transitive_reduction  #17408   Bandwidth of a graph  #17582  
ISGCI update, small graphs and recognition  #14396   Centrality betweenness in Sage  #18137  
G.triangles_count speedup  #18250   DiGraph.centrality_betweeenness  #18260  
Easier handling of vertex labels in graph backends  #18346   Export graph to file  #18828  
Use Sage to compute clustering coefficient  #18834   Strongly Regular Graphs database  #18948  
Strongly Regular Graphs from twoweight codes  #18960   Orthogonal Polar graphs in strongly_regular_graph  #18988  
Remove the (deprecated) _boundary parameter  #17462   New nonexistence tests for strongly regular graphs  #18982  
More SRGs using Regular Symmetric Hadamard matric with Constant Diagonal  #19018   Very careless typoes in strongly_regular_db  #19019  
Always check output in strongly_regular_graph  #19099   Three Wittbased strongly regular graphs  #19133  
Suzukirelated strongly regular graphs  #19216   Improved Graph.complement()  #19301  
Refactor Graph.__init__  #19381   Refactor DiGraph.__init__  #19385  
A (Di)Graph([V,E]) constructor  #19417   Update bliss  #19483  
Wrong results in Graph.treewidth()  #19358   sage unzip  #19484  
Zoom+move a Graph d3js representation  #19591   
Linear Programming

Feedback vertex set, Feedback arc set  #6962 #9911 #9923   Vertex Coloring, Edge Coloring  #6679 #7527 #7734  
Independent Set of Representatives  #6764   Knapsack  #6749  
Max Cut  #7291   Degree constrained subgraph  #7294  
Orientation of a graph with minimized outdegree  #7528   LexBFS and is_chordal  #7541  
Matching  #7593   Flows  #7592  
Dominating set and Independent dominating Set  #7594   vertex_cut and edge_cut ( minimum st cut )  #7599  
Vertex cover  #7600   Graph.edge_connectivity  #7601  
Graph.vertex_connectivity  #7605   Computing a Hminor  #8404  
Add a traveling salesman problem solver  #2203   Constraint Generation for TSP/Hamiltonian Cycle  #10497  
Bin Packing (uses Linear Programming)  #6763   Maximum Average Degree of a graph  #7529  
Multiway cut  #7289   Edgedisjoint spanning trees  #7476  
Steiner Tree  #8403   Linear Arboricity, Acyclic edge coloring  #8748  
Multiflow  #8870   disjoint routed paths  #8893  
Grundy coloring of a graph  #9575   Slight improvement to vertex_coloring  #9618  
topological minor  #8894   Longest path  #9910  
Independent set  #11846   Fractional Chromatic Index  #10044  
Convex Hulls, Hull number in graphs  #11279   Setting solverspecific options  #10785  
More solver options for GLPK  #12736   Deletion of rows and constants in the objective  #12823  
a polyhedron() method for LP  #14238   Optional parameters for Gurobi  #14566  
Cannot copy() instances of GurobiBackend  #12973   Add ppl_backend to the documentation  #14905  
GLPK incorrectly handles zero bounds  #14581   deprecate the dim argument for MIPVariables  #15489  
default LP variables will become real  #15521   A 'nonnegative' argument for .new_variable  #16504  
Remove the deprecated 'dim' argument of MIP variables  #17463   Polyhedron.to_linear_program  #18815  
Approximate LP solving: no exceptions  #18995   
Graph collection

Kneser Graph  #6823   Random Bipartite  #6828  
DeBruijn digraph  #7246   Toroidal Grid in graph_generators  #7536  
Create Bipartite Graph according to 2 degree sequences  #7590   The whole world in a graph  #6813 #7705  
Random Interval Graphs  #7487 #9862   digraphs.CircuitGraph  #7721  
IntervalGraph generator and a bug in is_chordal  #8284   CompleteMultipartiteGraph generator  #8923  
Graph constructor : Graph(edges=[ ... ] )  #7709   digraphs.RandomDirectedGNM  #11099  
New embeddings  #11399 #11397   Balaban 11Cage  #12942  
Balaban 12Cage  #12945   DoubleStarSnark, Foster's, Gray's, Harries'  #12952  
BiggsSmith graph  #12971   HarriesWong graph  #12980  
Ljubljana graph  #12981   McGee, Tutte12Cage, TutteCoxeter, Wagner  #12982  
EllinghamHorton  #12989   Clebsch, Coxeter, Hoffman  #13038  
Toroidal6RegularGrid2dGraph  #13075   FoldedCubeGraph  #13809  
Split graph_generators into several files  #13862   Schlafli graph constructor  #13709  
Tournament and directed path constructors  #14122   Circulant digraphs  #14251  
Wells graph  #14257   Sylvester and SimsGewirtz graphs  #14271  
Hypergraph enumeration through Nauty  #14474   M22 and Cameron graphs  #14283  
BrouwerHaemers graph  #14514   Symplectic graphs  #14532  
Random tournaments and Tournaments through nauty  #14536   McLaughlin Graph  #14547  
Meredith Graph  #15044   Some topological graphs  #15049  
Some Snarks  #15054   The Petersen Family  #15893  
600cell, 120cell  #2686   Orthogonal Polar Graph  #16362  
Affine Polar Graphs  #14631   IntersectionGraph constructor  #16526  
PerkelGraph  #18780   Chang graphs  #18785  
Livingstone graph  #18774   GossetGraph  #18779  
Dejter, F26A, Harborth, Klein*, LocalMcLaughlin  #18782   Truncated Icosidodecahedron  #18775  
Add a (175,72,20,36)SRGs (and two others)  #18998   A (220,84,38,28)SRG  #19180  
Two SRG on 243 and 276 vertices  #19247   swtich OA(k,n)+* strongly regular graphs  #19224  
A (729,336,153,156)strongly regular graph  #19311   A (280, 117, 44, 52)strongly regular graph  #19350  
GoethalsSeidel strongly regular graphs  #19342   A (512, 315, 202, 180)strongly regular graph  #19335  
A (729, 448, 277, 272)strongly regular graph  #19353   A (625, 468, 353, 342)strongly regular graph  #19344  
Polhill graphs on 1024 vertices  #19309   A (1288,792,476,504)strongly regular graph  #19317  
Three new SRGs and db update  #19777   JankoKharaghani strongly regular graphs  #19861  
Combinatorial Designs

Steiner Triple Systems  #8745   Cleanup in sage/combinat/design  #14499  
Steiner Quadruple Systems  #14562   Projective Plane designs  #15107  
Latin squares  #15286   Orthogonal Arrays  #15287  
Balanced Incomplete Block Designs with k=4  #15288   Organize the index of the combinat section  #16058  
Wilson's construction of TD/OA/MOLS  #15310   Equivalence between OA/TD/MOLS  #16231  
Product construction of Transversal Designs  #16227   A missing obvious case for BIBD  #16091  
Redesign transversal designs  #16272   Some trivial Orthogonal Arrays (when n=1)  #16248  
BIBD from Transversal Designs  #16279   A pair of orthogonal latin squares of order 10  #16235  
Allow k=None in MOLS/TD/OA  #16286   MOLS from the Handbook of Combinatorial Designs  #16277  
Five mutually orthogonal latin squares of order 12  #16236   New MOLS shared by Ian Wanless  #16241  
Construction of BIBD with k=5  #16323   Specify k,n in the exceptions  #16388  
Faster is_orthogonal_array  #16295   Helper functions for OA constructions  #16391  
a cache for OA/TD/MOLS existence  #16460   MOLS for n=18,57,154,276,298,342  #16356  
OA(7,66),OA(7,68),OA(8,69),OA(7,74),OA(8,76)  #16361   OA(18,273), OA(12,474), OA(33,993)  #16373  
Small speedup for OA(None,p^c)  #16430   Wilson's constructions of OA with 2 truncated groups  #16347  
Cheap speedup in the OA recursive constructions  #16499   New recursive constructions of Orthogonal Arrays  #16500  
Table of MOLS from the handbook and comparison  #16423   qx construction of Orthogonal Arrays  #16503  
OA(9,135)  #16524   OA(9,120)  #16528  
MOLS: Table with n<600 and updated syntax  #16582   Non existence of some small BIBD  #16614  
IncidenceStructure.degree  #16701   MOLS table: 10 000 integers  #16541  
IncidenceStructure.packing  #16709   Speedup for OA_from_quasi_difference_matrix  #16720  
New classes+is_group_divisible_design  #16598   OA 112,160,176,208,224,352,416,514,544,640,796,896  #16604  
OA 1046,1059,2164,3992,3994  #16662   is_difference_matrix  #16797  
OA 408,600,792,856,1368,2328,...  #16665   New OA for n=189, plus some others through Vmt vectors  #16763  
Three factor construction of MOLS  #16673   OA for n=262,950  #16716  
Organize the V(m,t) vectors into a dictionary  #16757   OA(17,560)  #16722  
Resolvable TD/OA and IncidenceStructure.relabel()  #16655   Resolvable incomplete orthogonal arrays  #16859  
New OA for n=189, plus some others through Vmt vectors  #16763   designs/database.py: autogenerated doc index  #16864  
Brouwer's separable design construction of OA  #16780   Merge 520+x OA constructors  #16867  
difference_matrices module  #16846   OA for n=205,254,469,520,522,524,1262  #16817  
Use float("inf") instead of Infinity  #16870   A real difference matrix has k columns  #16868  
Wider MOLS table plus better interface  #16887   Quasidifference matrices (database+is_QDM)  #16884  
OA caching in C  #16879   New user interface for OA and explain_construction(k,n)  #17034  
Isomorphism of incidence structures  #17047   IncidenceStructure.relabel() (no arguments)  #17104  
New V(m,t) vectors  #16920   BrouwerVan Rees version of Wilson's decomposition  #16559  
find_brouwer_van_rees_with_one_truncated_column  #16922   Isomorphism of incidence structures  #17047  
IncidenceStructure.degree(set={1,2,3})  #17108   iOA with big holes through product of OA  #17149  
IncidenceStructure.induced_substructure  #17577   iOA of type OA(k,n)OA(k,u)2.OA(k,1)  #17594  
The trace of a hypergraph  #17597   resolvable BIBD  #17581  
Stabilizer of a set of points  #17621   A GroupDivisibleDesign module with a couple of constructions  #17612  
Kirkman Triple Systems (end of the construction)  #17649   SubHypergraphSearch  #17309  
Automatic guess of the groups in a GDD  #17941   Improvement in IncidenceStructure.is_connected()  #18690  
New (v,6,1)BIBD with v<=201  #18934   IncidenceStructure.is_uniform, is_regular, complement  #18986  
IncidenceStructure.coloring  #17542   HigmanSims design and a new SRG  #19184  
Some new (n,2^k,1)BIBD  #19221   Graph.spanning_trees does not like loops  #19277  
IncidenceStructure.is_generalized_quadrangle  #19279   Better interface for hadamard_matrix  #19340  
Cleaning/Fix in combinat/matrices/hadamard_matrix  #19341   LinearCode.is_projective  #19462  
OtherStuff

Birkhoffâ€“von Neumann Theorem  #7492   Huffman Encoding  #8765  
graph.py: autogenerated broken links to Wikipedia  #8786   Update Networkx to 1.2  #9567  
Fast computation of Stirling numbers of 2nd kind  #9663   sloane_sequence(111776)[2][:36] != sloane.A111776.list(36)  #10025  
Little fixes for a major speedup of join/meet matrices for FiniteLatticePoset  #12476   Cplex needs another symbolic link  #11958  
A show method for permutations  #12872   Documentation and list of Graph functions  #12816  
Documentation of the facade argument in Poset contructor  #12961   Broken links in the documentation of graph/ files  #12810  
Some code clean up in graph.py  #13192   Boring paperwork in the graph/ files  #13188  
Move methods from GenericGraph to Graph  #13784   No permutation should be created that its methods cannot handle  #13742  
List of functions in the Permutations file  #13750   Change the default behaviour of Poset to facade=True  #13747  
Default parameters for Graph.plot() and show()  #13891   Some cleanup in sage.combinat.combinat  #14138  
expose PermutationGroup.all_blocks from GAP  #13102   Removal of sage.combinat.generator  #14355  
Orbits of tuples and sets  #14291   Helpful message if GAP fails to load a package  #14483  
Old deprecation warnings  #14473   A proper random_element() method for PerfectMatchings  #9890  
An Hypergraph class for visualization  #14712   Mistake in the doc of Steiner Quadruple Systems  #14696  
Finish cleanup in sage/combinat/design  #14950   Hypergraph automorphism group  #14859  
Arrangement of pseudolines  #12090   Longest common subword  #14969  
Some cleanup in groups.  #15368   A codes. object for Sage's codes  #15445  
WeylGroup and CoxeterGroup to groups.  #15435   groups.misc.AdditiveCyclic  #15369  
Check for doc build errors  #15727   Immutable graph backend for Posets  #15623  
Files needed in SAGE_ATLAS_LIB  #15787   Say that LP variables are nonnegative  #15482  
Cartesian Products of additive groups  #16269   random_element for Words is broken  #12867  
Default cumulative timings for %crun  #16765   PermutationGroup.minimal_generating_set  #17007  
Subsets with hereditary property  #16994   Improvement to subsets_with_hereditary_property  #17042  
deprecated_callable_import should change __doc__  #17038   Adding width() function to poset  #17023  
Poset.__repr__ should mention the linear extension  #17181   Poset.dimension  #17540  
Some cleanup in finance/stock  #18355   Fix standard_packages, optional_packages, experimental_packages  #18407  
Deprecate the 'dev' scripts  #18403   Make newstyle packages define their type and dependencies  #18431  
Make /type file mandatory  #18513   LatticePoset: add sublattice()  #18515  
Drop the NetworkX graph backend  #18375   Update git_trac to the latest commit of the repository  #18477  
ReFix standard_package, optional_packages, experimental_packages  #18456   Move the planarity files to a spkg  #18187  
Warning when installing newstyle experimental packages  #18566   Posets: canonical_label() returns a poset from lattice  #18516  
Test all installed optional packages by default  #18558   Automatically update newstyle optional packages  #18647  
Add pexpect to SAGERUNTIME  #18666   Separate the rankwidth library into a standard package  #18681  
latte_int: count integer points  #18812   Add a fixpkgchecksums argument to sage  #18947  
a MemoryAllocator object for easier memory management  #18868   Faster Poyhedron.graph()  #18860  
Remove useful doctest  #18991   LatticePoset: add is_planar()  #19191  
Fallback SAT solver in Sage  #19042   cython() does not know how to compile c++  #19325  
Support .zip upstream/ files  #19487   Rename rings.finite_rings.constructor  #19941  
Bugfixes

Small bug in Graph.plot()  #6615   bad ReST formatted docstring in 6819  #6845  
clean up sage/numerical/mip.pyx  #7012   Adds Linear Programming to the Constructions document  #7652  
Graph(g) does not keep the embedding !  #7733   solveGLPK and solve_coin need doctests !!!  #7925  
documentation bug on new gale_ryser_theorem()  #8081   Bug when defining a MIPVariable's type  #8639  
Duplicate version of feedback_arc/vertex_set  #8798   Many doctests fails since the update of NetworkX !  #8892  
Create an efficient SUM command  #9061   Broken docstrings in Travelling Salesman Problem  #9230  
Broken docstring in binpacking method  #9392   remove remaining "optional  GLPK" tags on doctests  #9432  
Wrong LP solver ordering  #9570   Raise an exception in add_constraint  #9579  
Error in edge_cut  #9852   Doctest error in sage/graphs/graph.py  #9925  
Additional test in is_even_hole_free  #9930   Cliquer does not like empty graphs  #10756  
Bug in Huffman algorithm  #10864   edge labels should be unique  #11181  
replace NetworkX empty dictionaries  #11182   Rounding values, and inconsistencies in graph methods  #11367  
Error in MILP documentation  #11371   copying a linear program crashes Sage  #11588  
simplify constraints in linear programs  #11606   Bug in is_chordal  #11735  
Connectivity of complete graphs  #11910   Memory leaks with LP Solvers  #11917  
Update Graph.clique_number to use MILP  #11928   segfault on Graph().connected_component_containing_vertex('')  #11942  
Update Graph.clique_maximum to use MILP  #11944   Bug in topological_sort  #11950  
Fixes a bug in is_chordal  two algorithms  #11961   doctest failure in linear_programming.rst  #12019  
failing doctest in gale ryser theorem  #12022   Bug when taking complement of bipartite graph.  #12155  
Empty graphs and new distance computations  #12244   Graph chromatic_number documentation  #12378  
Rounding error in graph coloring  #12389   Graph.relabel modifies the dictionary given as an input  #12477  
The LP are not deallocated because of cyclic references !  #12616   Bug in Graph.girth  #12355  
Memory leaks with CPLEX  #12903   Longest path broken for digraphs  #13019  
Bug in is_isomorphic for multigraphs  #13114   Bugfix in is_cartesian_poduct  #13599  
Memory leaks with Cliquer  #12905   sage.isgci.update_db is broken  #13635  
Another bug in add_edge  #13664   Another bug in graph products  #13699  
Bug in Graph() with loops AND multiple edges  #13775   Add encofind to smallgraphs.py  #13936  
Bug in Graph() when input is a weighted matrix  #13919   Bug in is_perfect  #13546  
Bug in line_graph() when the vertices cannot be compared  #13787   Very bad mistakes in linear_arboricity  #14128  
Stopgap warning in Poset.relabel  #14185   Stopgap warning in Graph.modular_decomposition  #14173  
Bad error management in the CPLEX interface  #14195   CBC compilation problem  #14310  
Bug in MixedIntegerLinearProgram.polyhedron  #14395   Automorphism group with labeled vertices  #14319  
Bug in DiGraph.longest_path  #14412   Gurobi is not built because of a typo !  #14531  
is_circular_planar does not behave as expected  #14442   Useless memory allocation in subgraph_search  #14659  
Update optional CBC spkg  #14522   Vertex connectivity of tournaments  #14856  
Default embedding of Ljubljana graph  #15228   is_linear_extension on posets is rather liberal  #15313  
Cleanup in numerical.knapsack  #15414   Remove deprecated code from combinat/  #15466  
Partitions return wrong result for obvious reasons  #15467   Words.__eq__ returns wrong answers  #15480  
directed immutable graphs report twice too many edges  #15491   CBC : undefined symbol: dgetrf_  #15442  
DegreeSequences(n) returns false positive  #15503   Static sparse graphs on > 65536 vertices  #15507  
Finite Words should be proud of their finiteness  #15479   Memory leak in the interface with Gurobi  #15284  
Broken links in the doc of graph/ and numerical/  #15553   Poset.is_chain is wrong  #15330  
Poset.lt computes too much  #15332   Immutable graphs must not be relabeled  #15622  
Integers have no order  #15661   Error with edges in empty immutable graph  #15665  
Bug in AffineGeometryDesign  #15285   Name of immutable graphs  #15681  
isotopism method uses product of permutations  #15439   Bug in IncidenceStructure.is_block_design  #15664  
Immutable directed graphs are directed  #15810   is_distance_regular is awfully wrong  #15864  
Remove deprecated code from combinat/  #15466   Bug in Graph.subdivide_edge  #15895  
(disjoint) Union of graphs with multiple edges  #15627   Bug in IncidenceStructure.dual_design  #16032  
Connected components for immutable digraphs  #16019   is_hamiltonian: nonsimple digraphs  #16214  
is_hamiltonian: wrong exceptions are caught  #16210   small bug in G.strong_orientation()  #16307  
Unnatural syntax of G.relabel()  #16257   Bug in IncidenceStructure.automorphism_group()  #16358  
IncidenceStructure.automorphism_group with correct labels  #16367   clique_with_loops.is_strongly_regular() is True  #16433  
Deprecate the _boundary parameter  #15494   IntegerRanger._repr_ now uses ... instead of ..  #16525  
Deprecate Hypergraph  #16622   Raise exceptions when database_gap is not installed  #16702  
IncidenceStructure.__contains__  #16727   PermutationGroup.blocks_all with correct labels  #16730  
Bug in automorphism_group when points are pairs  #16741   trivial bug when building OA(4,12)  #16772  
Default behaviour of AdditiveAbelianGroup(a_tuple)  #16261   Graphs, offbyone check in static sparce backend  #17110  
Sage is missing one letter  #17111   Graph(immutable_digraph) raises an error  #17156  
Error in semisymmetric graph documentation  #17162   Bug in explain_construction for Brouwervan Rees  #17253  
to_(di)rected and immutable graphs  #17005   Degrees of looped *immutable* graphs are wrong  #17225  
Remove useless "copy" arguments and normalize steiner_quadruple_system  #17232   Poset: change rank dict to rank array  #17191  
Memory leaks with LP Solvers are back  #17320   Cleanup subgraphsearch to avoid crashes  #17376  
Slowness when calling Graph(a_dictionary)  #17384   creating a (136,4,1)BIBD raises an exception  #17557  
deprecate Graph.to_partition and Poset.to_graph  #17449   Setting .copy(immutable=False) everywhere  #17370  
edge_cut sometimes returns an incorrect cut  #12797   Move from_* functions from Partitions to Partitions_all  #17648  
Subgraph of Hasse Diagram gives error  #17683   Doctest failure in orthogonal_arrays.py  #17672  
Remove (various) deprecated code  #17461   Stopgap for IntegerListsLex  #17637  
Wrong result returned by Graph.is_interval  #17787   Cleanup of sage.graphs.pq_trees  #17804  
Risk of confusion between LPProblem and MixedIntegerLinearProgram  #17867   Incorrect decomposition returned by Graph.treewidth  #17893  
make modular_decomposition an optional spkg  #17950   Can add vertex to immutable graph once  #18149  
No lexicographic iterator over finite binary words  #18148   sage/graphs/graph.py: multigraph recognition in init fails  #18067  
Make centrality_betweenness interruptible  #18262   Random failure in  #  
failure in simple_connected_genus_backtracker.__dealloc__  #17750   Wrong result returned by is_planar on a given embedding  #18045  
Clean the Graph/DiGraph constructors  #18185   Compute the degree of a vertex without using networkX  #18335  
Bug in GomoryHu tree algorithm  #16475   list(ZZ) > infinite loop  #18378  
Broken (optional) doctests with bliss  #18460   Make Graph.sparse6 work on noninteger graphs  #18445  
CVXOPT should not accept integer variables  #18571   Rewrite "optional Coin" as "optional cbc"  #18559  
Skipped doctests in graph_plot.py  #18658   Empty hypergraph and __str__ function  #17574  
Add a hint in the automatic doctest sig_on_count()  #18829   Doctest failure in LocalMcLaughlinGraph  #18911  
Remove three class constructors from designs.  #19096   Fix name of graph.complement()  #19109  
Check CPLEXBackend.solver_parameter  #19117   Polyhedron.delete > _delete  #18814  
Avoid a %crun crash  #19185   Graph.spanning_trees does not like loops  #19291  
Remove pointers from boost_interface  #19564   Missing functions in the rest index of function  #19596  
Less wasteful management of edge labels  #19662   strongly_regular_graph() crashes when mu=0  #19712  
Permutation.__init__: negative>nonpositive  #19746   matrix.zero(15)  #19862  
Documentation

improve Graph?  #5911   Docstrings for graphs_generators.CubeGraph  #7386  
Including graph modules in the doc  #8513   Improving the Graph Theory table of contents  #9861  
100% coverage in graph directory  #10900   Some comments in the code of SparseGraph  #11046  
Graph Theory tour  #6774   Linear Programming Thematic Tutorial  #9836  
French translation: A Tour of Sage  #7190   Sphinx Warning: Missing title for sage.misc.exceptions after 9249  #9571  
Updated docstring for Graph.cores  #11637   Making the reference manual's introduction more concise  #16452  
Removes the Graph Theory constructions pages  #16223   Sage's doc believes we are in 2011  #16551  
Cleaning the Graph documentation index  #16398   Improve the doc of combinat/designs/  #16766  
Document all options of Poset.show and Poset.plot  #11284   Index of poset constructors  #17424  
Reformat the developer's manual's page about docstrings  #17508   Rephrase the developer's manual's index  #17509  
Rephrase 'git the hard way'  #17551   The reviewer's checklist  #17534  
Rephrase the 'doctest flags' section  #17549   Small changes in the developer's manual toc  #17589  
Remove the dev scripts' documentation  #17555   Rephrase 'Reporting bugs' of the developer's manual  #17545  
rephrase "LaTeX formating" and "Writing doctests"  #17592   Documentation and default of Graph.show(method="js")  #17646  
How to call C code from Sage thematic tutorial  #17605   Move numerical_sage into thematic_tutorials  #17614  
Move bordeaux_2008 into thematic_tutorials  #17615   Cleanup in the thematic tutorials  #17616  
Rephrase the 'sage manuals' section of the developer manual  #17634   Pictures in the doc through ".. plot::" directive  #17498  
Add permutations_cython to the doc  #17848   Add "indirect doctest" to the list of doctest flags  #17868  
Rephrase the 'deprecation' section of the developer's manual  #17871   A tutorial on profiling in Sage  #17689  
General documentation about graph data structures  #18317   Emphasize that Graph.subgraph_search ignores edge labels  #18296  
More meaningful error messages in _check_embedding_validity  #17656   Explicitly say that arguments to Graph.plot() are forwarded  #18646  
Cleanup in the 'installation' manual  #18405   Autogenerated index of functions  #18926  
Incomplete sentences in the automatically generated documentation  #19067   Minor typos in 6.8  #19023  
Autogenerated thematic index of functions  #19061   Update the documentation of Graph/DiGraph constructors  #19390  
Index of Permutation Group methods  #19901   