scientific article; zbMATH DE number 3215865

zbMATH Open0133.16702MaRDI QIDQ5342985FDOQ5342985

Authors: Lajos Pósa 

Publication date: 1964

Title of this publication is not available (Why is that?)

zbMATH Keywords

topology

Cited In (42)

• A variation of a theorem by Pósa
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
• Partitioning 2-edge-colored graphs by monochromatic paths and cycles
• Recent advances on the Hamiltonian problem: survey III
• Vertex covers by monochromatic pieces -- a survey of results and problems
• A note on the linear cycle cover conjecture of Gyárfás and Sárközy
• Monochromatic loose-cycle partitions in hypergraphs
• New sufficient conditions for cycles in graphs
• On a property of 2-connected graphs and Dirac's theorem
• Oriented discrepancy of Hamilton cycles
• Heavy cycles and spanning trees with few leaves in weighted graphs
• Partitioning edge-colored hypergraphs into few monochromatic tight cycles
• Pancyclic graphs and linear forests
• The Turán number of Berge hypergraphs with stable properties
• Hamiltonian cycles and dominating cycles passing through a linear forest
• Methods for determining cycles of a specific length in undirected graphs with edge weights
• A look at cycles containing specified elements of a graph
• Long cycles in bipartite graphs
• Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
• A note on color-bias Hamilton cycles in dense graphs
• The extremal function for two disjoint cycles
• Cycles in bipartite graphs
• An implicit degree condition for long cycles in 2-connected graphs
• On the discrepancies of graphs
• Neighborhood unions and disjoint chorded cycles in graphs
• Discrepancies of spanning trees and Hamilton cycles
• Hamiltonian numbers in oriented graphs
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs
• Stability in the Erdős-Gallai theorems on cycles and paths
• Finding long cycles in balanced tripartite graphs: a first step
• Disjoint chorded cycles in graphs
• Neighborhood unions for the existence of disjoint chorded cycles in graphs
• Comparison of sufficient degree based conditions for Hamiltonian graph
• Weighted degrees and heavy cycles in weighted graphs
• A stability version for a theorem of Erdős on nonhamiltonian graphs
• Large cycles in graphs
• An implicit weighted degree condition for heavy cycles
• The binding number of a graph and its Anderson number
• The number of edges, spectral radius and Hamilton-connectedness of graphs
• Ramsey-type results for path covers and path partitions

This page was built for publication:

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