The theory of regular graphs

DOI10.1007/BF02392606MaRDI QIDQ1531696zbMATH OpenWikidataFDO

Authors Jul. Petersen

Publication date 1891

Published in Acta Mathematica (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (05C99)

Cited in

(13)

• Perfect matching and zero-sum 3-magic labeling
• Approximating maximum edge 2-coloring by normalizing graphs
• The hitting time of clique factors
• Spanning even trees of graphs
• 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
• Finding triangle-free 2-factors in general graphs
• The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark

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)