From the theory of regular graphs of third and fourth degree

From MaRDI portal
Publication:3287782

DOI10.21136/cpm.1957.117236zbMath0103.39703OpenAlexW3047924496MaRDI QIDQ3287782

Anton Kotzig

Publication date: 1957

Full work available at URL: https://doi.org/10.21136/cpm.1957.117236




Related Items (33)

A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphsDecomposition of \((2k + 1)\)-regular graphs containing special spanning \(2k\)-regular Cayley graphs into paths of length \(2k + 1\)Index of parameters of iterated line graphsPath decompositions of regular graphs with prescribed girthOn path decompositions of \(2k\)-regular graphsRandom 4-regular graphs have 3-star decompositions asymptotically almost surelyHamiltonicity and colorings of arrangement graphsOn path decompositions of \(2 k\)-regular graphsDecompositions of 6-regular bipartite graphs into paths of length sixDecomposing regular graphs with prescribed girth into paths of given lengthDecomposing subcubic graphs into claws, paths or trianglesOn star decompositions of random regular graphsImproved approximation bounds for the minimum rainbow subgraph problemEdge-disjoint Hamilton cycles in 4-regular planar graphsSparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuitsSnarks and flow-snarks constructed from coloring-snarks.NP-completeness of edge-colouring some restricted graphsOn the tractability of some natural packing, covering and partitioning problemsDecompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges eachEdge $k$-$q$-Colorability of GraphsDecomposing highly connected graphs into paths of length fiveUnnamed ItemCodes for distributed storage from 3-regular graphsApproximation algorithms for the minimum rainbow subgraph problemSulla tracciabilita' di grafi finiti su superficie compatteOn spanning subgraphs of 4-connected planar graphsAlcuni sviluppi sulla teoria relativa dei singrammi finitiA note on edge-decompositions of planar graphsGraphentransformationenSur l'indice chromatique du graphe représentatif des arêtes d'un graphe régulierDecompositions of triangle-free 5-regular graphs into paths of length fiveTwo Hamiltonian cycles\(\vec{P_3}\)-decomposition of directed graphs




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