Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
4-regular graphs
Description:
Graphs in which every vertex has degree four, studied in graph theory and its applications.
Primary topic:
Advanced Graph Theory Research (53%)
Related topics:
Advanced Graph Theory Research (53%),
Graph Labeling and Dimension Problems (9%)
Wikidata ID:
wiki/Q7269362
OpenAlex ID:
keywords/4-regular-graphs
Greedy algorithm and symmetric matroids
1987
·
André Bouchet
·
Mathematical Programming
·
256
Fast generation of regular graphs and construction of cages
1999
·
Markus Meringer
·
Journal of Graph Theory
·
221
Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
1980
·
David P. Dailey
·
Discrete Mathematics
·
197
Graphic presentations of isotropic systems
1988
·
André Bouchet
·
Journal of Combinatorial Theory Series B
·
147
Hamiltonian decomposition of Cayley graphs of degree 4
1989
·
J.-C Bermond
, O Favaron
, et al.
·
Journal of Combinatorial Theory Series B
·
146
PDF
Isotropic Systems
1987
·
André Bouchet
·
European Journal of Combinatorics
·
113
PDF
On a 1, 2 Conjecture
2010
·
Jakub Przybylo
, Mariusz WoźniaK
·
Discrete Mathematics & Theoretical Computer Science
·
103
PDF
Covering and packing in graphs IV: Linear arboricity
1981
·
Jin Akiyama
, Geoffrey Exoo
, et al.
·
Networks
·
101
Graph-encoded 3-manifolds
1985
·
Sóstenes Lins
, Arnaldo Mandel
·
Discrete Mathematics
·
97
$\Gamma$-convergence of graph Ginzburg-Landau functionals
2012
·
Andrea L. Bertozzi
, Yves van Gennip
·
Advances in Differential Equations
·
88
PDF
Maximum independent sets in 3- and 4-regular Hamiltonian graphs
2010
·
Herbert Fleischner
, Gert Sabidussi
, et al.
·
Discrete Mathematics
·
77
Knots and Graphs I—Arc Graphs and Colorings
1999
·
Frank Harary
, Louis H. Kauffman
·
Advances in Applied Mathematics
·
69
Computation of contour integrals on ℳ 0 , n $$ {\mathrm{\mathcal{M}}}_{0,\mathrm{n}} $$
2016
·
Freddy Cachazo
, Humberto Gomez
·
Journal of High Energy Physics
·
68
PDF
Multimatroids I. Coverings by Independent Sets
1997
·
André Bouchet
·
SIAM Journal on Discrete Mathematics
·
68
k-ordered Hamiltonian graphs
1997
·
Lenhard Ng
, Michelle Schultz
·
Journal of Graph Theory
·
68
Almost all graphs with average degree 4 are 3-colorable
2003
·
Dimitris Achlioptas
, Cristopher Moore
·
Journal of Computer and System Sciences
·
64
PDF
On Transition Polynomials of 4-Regular Graphs
1990
·
F. Jaeger
·
Springer eBooks
·
62
Efficient domination in circulant graphs with two chord lengths
2007
·
Nenad Obradović
, Joseph Peters
, et al.
·
Information Processing Letters
·
57
Almost all graphs with average degree 4 are 3-colorable
2002
·
Dimitris Achlioptas
, Cristopher Moore
·
ACM Symposium on Theory of Computing (STOC)
·
53
On Approximately Counting Colorings of Small Degree Graphs
1999
·
Russ Bubley
, Martin Dyer
, et al.
·
SIAM Journal on Computing
·
47
How to transform graph states using single-qubit operations: computational complexity and algorithms
2020
·
Axel Dahlberg
, Jonas Helsen
, et al.
·
Quantum Science and Technology
·
46
PDF
An infinite family of circulant graphs with perfect state transfer in discrete quantum walks
2019
·
Hanmeng Zhan
·
Quantum Information Processing
·
45
PDF
Multimatroids III. Tightness and Fundamental Graphs
2001
·
André Bouchet
·
European Journal of Combinatorics
·
45
PDF
Explicit unique-neighbor expanders
2003
·
N. Alon
, M. Capalbo
·
Annual Symposium on Foundations of Computer Science
·
44
Tutte-martin polynomials and orienting vectors of isotropic systems
1991
·
André Bouchet
·
Graphs and Combinatorics
·
43
Show more works
View as search
Works count:
510
Citation count:
5,095
Year
Topic
Type