lichengzhang1

Pinned Repositories

4-regular-plane-graphs-with-given-faces
Language:C0 1 00
awesome-ebooks
收录开源的经典技术书籍 PDF 文件及相关网站，持续更新中...
00
beoi-training
Public training materials for Belgian Oympiad in Informatics
Language:TeX0 0 00
BibTeX_template
Language:TeX0 1 00
book-sudocodes
Pseudo-codes for Graph Theory Book
Language:C++00
cds-code
An implementation of connected dominating sets in triangulations
Language:Python00
chordless-graphs-generator
Counting chordless cycles in undirected graphs
Language:C++00
Cograph_generator
Language:Python00
gradpart
2 1 00
qud
Quadrangulation with the longest induced cycle of length 6
1 1 00

lichengzhang1's Repositories

lichengzhang1/gradpart
2 1 00
lichengzhang1/qud
Quadrangulation with the longest induced cycle of length 6
1 1 00
lichengzhang1/4-regular-plane-graphs-with-given-faces
Language:C0 1 00
lichengzhang1/awesome-ebooks
收录开源的经典技术书籍 PDF 文件及相关网站，持续更新中...
00
lichengzhang1/beoi-training
Public training materials for Belgian Oympiad in Informatics
Language:TeX0 0 00
lichengzhang1/BibTeX_template
Language:TeX0 1 00
lichengzhang1/cds-code
An implementation of connected dominating sets in triangulations
Language:Python00
lichengzhang1/CographGeneration
Cograph Generation (linear delay) - format g6
Language:C#0 0 00
lichengzhang1/complete-graphs
Language:Java0 0 00
lichengzhang1/doc
Documentation
Language:HTML0 0 00
lichengzhang1/myfig
0 1 00
lichengzhang1/quadrangulations
all quadrangulations on 14 vertices.
0 1 00
lichengzhang1/Spectra-of-graphs
One Mathematica program computes the spectrum of a graph with a Laplacian on the edges (a quantum graph). The other programs find sets of isospectral quantum graphs.
Language:Mathematica0 0 00
lichengzhang1/competitive-programming
Solutions to some of good questions asked in coding rounds for internship/placements in big companies.
lichengzhang1/FastPartitioner
A fast hypergraph partitioner that runs on the GPU
Language:C++0 0
lichengzhang1/hamiltonian_cycles
Code and data related to the paper "Few hamiltonian cycles in graphs with one or two vertex degrees"
Language:C0 0
lichengzhang1/IGraphM
IGraph/M is the igraph interface for Mathematica
Language:Mathematica0 0
lichengzhang1/Induced-H-Saturated-Graphs
Language:Sage0 0
lichengzhang1/joeis
Java implementations of sequences in the OEIS
lichengzhang1/K2-Hamiltonian-Graphs
This repository contains four programs which were created for the article "J. Goedgebeur, J. Renders, G. Wiener and C.T. Zamfirescu, K2-Hamiltonian Graphs: II, manuscript", as well as some certificates that can be used to verify some of the computer-aided proofs in this article.
lichengzhang1/longestCycles
Code related to counting the number of pairwise distinct longest cycles of a graph
lichengzhang1/m3c
Python scripts for generating minimally 3-connected graphs
lichengzhang1/Minimum-Cost-Perfect-Matching
C++ implementation of algorithms for finding perfect matchings in general graphs
lichengzhang1/NSFC-application-template-latex
国家自然科学基金申请书正文（面上项目）LaTeX 模板（非官方）
Language:TeX0 0
lichengzhang1/Perfect-Graphs
lichengzhang1/ptmst
Probability Theory and Mathematical Statistics Tutorial
lichengzhang1/sat-modulo-symmetries
Language:C++
lichengzhang1/Sparse-maximal-2-planar-graphs
Code repository for the paper titled "The number of edges in maximal 2-planar graphs" by Michael Hoffmann and Meghana M Reddy
Language:C++0 0
lichengzhang1/tikzit
pgf/TikZ diagram editor
Language:C++0 0
lichengzhang1/tinygraph
exploring graph conjectures on small graphs