The theory of regular graphs

Cited in

(51)

Finding triangle-free 2-factors in general graphs
The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
Perfect matching and zero-sum 3-magic labeling
Approximating maximum edge 2-coloring by normalizing graphs
Spanning even trees of graphs
The hitting time of clique factors
Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions
The fine-grained complexity of approximately counting proper connected colorings (extended abstract)
Connectivity graph-codes
The edge coloring of the Cartesian product of signed graphs
Approximate realizations for outerplanaric degree sequences
Note on robust coloring of planar graphs
On a conjecture that strengthens Kundu's k-factor theorem
Monotonic decompositions of submodular set functions
A formal correctness proof of Edmonds' blossom shrinking algorithm
Uniformly sampling random directed hypergraphs with fixed degrees
Periodic colorings and orientations in infinite graphs
A glimpse into the story of Danish mathematics.
A note on regular factors in vertex-deleted subgraphs of regular bipartite graphs
Antimagic labelings on graphs with ascending subgraph decomposition
The degree-restricted random process is far from uniform
A note on the restricted edge connectivity and perfect matchings of regular graphs
Spectral conditions for k-extendability and k-factors of bipartite graphs
Resistance, oddness and colouring defect of snarks
Computational complexity of covering multigraphs with semi-edges: small cases
An approach to the girth problem in cubic graphs
Realizing graphs with cut constraints
Hypercurveball algorithm for sampling hypergraphs with fixed degrees
Comparing the p-independence number of regular graphs to the q-independence number of their line graphs
Nice vertices in cubic graphs
Claw-free cubic graphs are (1,1,2,2)-colorable
Vertex partitioning of graphs into odd induced subgraphs
2-colorable perfect matching is NP-complete in 2-connected 3-regular planar graphs
Approximating maximum edge 2-coloring by normalizing graphs
On generalizations of pairwise compatibility graphs
On a conjecture of Erdős on size Ramsey number of star forests
The hitting time of clique factors (extended abstract)
The total vertex irregularity strength for cubic graphs with a perfect matching
The number of perfect matchings in a brick
Facial matchings in plane graphs
Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity
2-factors in graphs
Cubic graphs with edges in exactly one perfect matching
Path odd-covers of graphs
A note on the spectral radius and \([a,b]\)-factor of graphs
Strong binding numbers and factors
Eigenvalues and factors: a survey
Spanning weakly even trees of graphs
On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
The AVD-total chromatic number of fullerene molecular graphs
Lower bounds for maximum weight bisections of weighted triangle-free subcubic graphs

This page was built for publication: The theory of regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1531696)