scientific article; zbMATH DE number 3215865
From MaRDI portal
Publication:5342985
zbMath0133.16702MaRDI QIDQ5342985
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Vertex covers by monochromatic pieces -- a survey of results and problems, Stability in the Erdős-Gallai theorems on cycles and paths, A stability version for a theorem of Erdős on nonhamiltonian graphs, Neighborhood unions for the existence of disjoint chorded cycles in graphs, On a sharp degree sum condition for disjoint chorded cycles in graphs, Discrepancies of spanning trees and Hamilton cycles, Hamiltonian numbers in oriented graphs, On the discrepancies of graphs, Oriented discrepancy of Hamilton cycles, The Turán number of Berge hypergraphs with stable properties, Monochromatic loose-cycle partitions in hypergraphs, A variation of a theorem by Pósa, Methods for determining cycles of a specific length in undirected graphs with edge weights, Heavy cycles and spanning trees with few leaves in weighted graphs, Cycles in bipartite graphs, Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs, Recent advances on the Hamiltonian problem: survey III, An implicit weighted degree condition for heavy cycles, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Partitioning 2-edge-colored graphs by monochromatic paths and cycles, COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH, The number of edges, spectral radius and Hamilton-connectedness of graphs, A note on the linear cycle cover conjecture of Gyárfás and Sárközy, The binding number of a graph and its Anderson number, Disjoint chorded cycles in graphs, Minimum degree, independence number and pseudo \([2, b\)-factors in graphs], Pancyclic graphs and linear forests, The extremal function for two disjoint cycles, Hamiltonian cycles and dominating cycles passing through a linear forest, Large cycles in graphs, Neighborhood unions and disjoint chorded cycles in graphs, An implicit degree condition for long cycles in 2-connected graphs, Finding long cycles in balanced tripartite graphs: a first step, A Note on Color-Bias Hamilton Cycles in Dense Graphs, A look at cycles containing specified elements of a graph, Weighted degrees and heavy cycles in weighted graphs, On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity, Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles, Ramsey-type results for path covers and path partitions, Long cycles in bipartite graphs, New sufficient conditions for cycles in graphs
