From the theory of regular graphs of third and fourth degree

Cited In (33)

\(\vec{P_3}\)-decomposition of directed graphs
Decomposition of the complete bipartite graph with a 1-factor removed into paths and stars
Snarks and flow-snarks constructed from coloring-snarks.
Improved approximation bounds for the minimum rainbow subgraph problem
Edge \(k\)-\(q\)-colorability of graphs
NP-completeness of edge-colouring some restricted graphs
On spanning subgraphs of 4-connected planar graphs
Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each
Codes for distributed storage from 3-regular graphs
A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
Random 4-regular graphs have 3-star decompositions asymptotically almost surely
Decomposition of \((2k + 1)\)-regular graphs containing special spanning \(2k\)-regular Cayley graphs into paths of length \(2k + 1\)
Decomposing subcubic graphs into claws, paths or triangles
Sulla tracciabilita' di grafi finiti su superficie compatte
Hamiltonicity and colorings of arrangement graphs
Decompositions of 6-regular bipartite graphs into paths of length six
Path decompositions of regular graphs with prescribed girth
On path decompositions of \(2k\)-regular graphs
Edge-disjoint Hamilton cycles in 4-regular planar graphs
On the tractability of some natural packing, covering and partitioning problems
Graphentransformationen
On star decompositions of random regular graphs
Alcuni sviluppi sulla teoria relativa dei singrammi finiti
Decomposing highly connected graphs into paths of length five
A note on edge-decompositions of planar graphs
Approximation algorithms for the minimum rainbow subgraph problem
Sur l'indice chromatique du graphe représentatif des arêtes d'un graphe régulier
Two Hamiltonian cycles
Decompositions of triangle-free 5-regular graphs into paths of length five
On path decompositions of \(2 k\)-regular graphs
Index of parameters of iterated line graphs
Decomposing regular graphs with prescribed girth into paths of given length

This page was built for publication: From the theory of regular graphs of third and fourth degree

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