Arc coverings of graphs
From MaRDI portal
Publication:774916
DOI10.1007/BF02412090zbMath0103.39702OpenAlexW2012896465MaRDI QIDQ774916
Publication date: 1961
Published in: Annali di Matematica Pura ed Applicata. Serie Quarta (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02412090
Related Items (79)
The Hamiltonian problem and \(t\)-path traceable graphs ⋮ Subgraphs intersecting any Hamiltonian cycle ⋮ The Ramsey numbers of trees versus \(W_{6}\) or \(W_{7}\) ⋮ On Hamiltonian bipartite graphs ⋮ Relating path coverings to vertex labellings with a condition at distance two ⋮ On a packing problem of Alon and Yuster ⋮ The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs ⋮ A note on the 2-power of Hamilton cycles ⋮ Geodesic-pancyclic graphs ⋮ Scattering number and extremal non-Hamiltonian graphs ⋮ Extremal problems on the Hamiltonicity of claw-free graphs ⋮ Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs ⋮ The formula for Turán number of spanning linear forests ⋮ Further results on Hendry's Conjecture ⋮ Pancyclic graphs and a conjecture of Bondy and Chvatal ⋮ Ordering \(Q\)-indices of graphs: given size and circumference ⋮ On the path partition number of 6‐regular graphs ⋮ The global resilience of Hamiltonicity in \(G(n, p)\) ⋮ Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles ⋮ Eigenvalues and cycles of consecutive lengths ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian ⋮ On extremal hypergraphs for Hamiltonian cycles ⋮ On the path partition of graphs ⋮ On path-coverings and Hamilton-connectivity of finite graphs ⋮ The maximum number of cliques in graphs with prescribed order, circumference and minimum degree ⋮ An Ore-type condition for hamiltonicity in tough graphs and the extremal examples ⋮ Completion and deficiency problems ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ Maximale Kreise in Graphen ⋮ A sufficient condition for a graph to contain two disjoint Hamiltonian cycles ⋮ Smallest maximally nonhamiltonian graphs ⋮ The Turán number for spanning linear forests ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ On the construction of combinedk-fault-tolerant Hamiltonian graphs ⋮ On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree ⋮ Turán numbers for disjoint copies of graphs ⋮ COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH ⋮ On saturation games ⋮ Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs ⋮ Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius ⋮ Smallest maximally nonhamiltonian graphs. II ⋮ On vertex-disjoint paths in regular graphs ⋮ Spectral results on Hamiltonian problem ⋮ Hamilton-chain saturated hypergraphs ⋮ Spectral analogues of Erdős' theorem on Hamilton-connected graphs ⋮ Unnamed Item ⋮ On n-hamiltonian line graphs ⋮ Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen ⋮ On path connected graphs ⋮ Edge sets contained in circuits ⋮ Panconnected graphs. II ⋮ A lower bound for the circumference of a graph ⋮ Fault-tolerant Hamiltonian connectivity of the WK-recursive networks ⋮ Anti-Ramsey numbers for disjoint copies of graphs ⋮ On star-critical and upper size Ramsey numbers ⋮ Path coverings of the vertices of a tree ⋮ Conditional chromatic numbers with forbidden cycles ⋮ The Turán number of sparse spanning graphs ⋮ Rainbow numbers for cycles with pendant edges ⋮ Extending cycles in graphs ⋮ Spectral radius and Hamiltonian properties of graphs ⋮ Spectral radius and Hamiltonicity of graphs with large minimum degree ⋮ Large cycles in graphs ⋮ On k-path Hamiltonian graphs and line-graphs ⋮ Mutually orthogonal Hamiltonian connected graphs ⋮ Finding long cycles in balanced tripartite graphs: a first step ⋮ An Adaptive Multigrid Method Based on Path Cover ⋮ Theory of path length distributions. I ⋮ Minimum path cover in quasi-claw-free graphs ⋮ Minimal colorings for properly colored subgraphs ⋮ All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight) ⋮ Stability results on the circumference of a graph ⋮ On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity ⋮ The maximum size of a nonhamiltonian graph with given order and connectivity ⋮ Hamiltonian Chains in Hypergraphs ⋮ Spectral and extremal conditions for supereulerian graphs ⋮ Proof of a conjecture on the spectral radius condition for \([a,b\)-factors] ⋮ Partition of a bipartite Hamiltonian graph into two cycles
This page was built for publication: Arc coverings of graphs
