Some Theorems on Abstract Graphs
From MaRDI portal
Publication:5812733
DOI10.1112/plms/s3-2.1.69zbMath0047.17001OpenAlexW1971367602WikidataQ56209816 ScholiaQ56209816MaRDI QIDQ5812733
Publication date: 1952
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-2.1.69
Related Items
Vertex pancyclic graphs, Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs, The fractional strong metric dimension in three graph products, On one extension of Dirac's theorem on Hamiltonicity, Gaps in the saturation spectrum of trees, Relating path coverings to vertex labellings with a condition at distance two, Dirac's minimum degree condition restricted to claws, \(D_ \lambda\)-cycles in \(\lambda\)-claw-free graphs, \(C_ 6\)-free bipartite graphs and product representation of squares, Degree sum conditions on two disjoint cycles in graphs, Subgraph distances in graphs defined by edge transfers, Cycles through subsets with large degree sums, The complexity of recognizing tough cubic graphs, A sufficient condition for all short cycles, Degree sum conditions for Hamiltonicity on \(k\)-partite graphs, Square Hamiltonian cycles in graphs with maximal 4-cliques, Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path, Hamilton cycles in sparse robustly expanding digraphs, Hamiltonicity in 2-connected graphs with claws, Large circuits in binary matroids of large cogirth. I, Hamiltonicity, minimum degree and leaf number, Intersections of longest cycles in \(k\)-connected graphs, Finding modes with equality comparisons, The hidden algorithm of Ore's theorem on Hamiltonian cycles, Cycle lengths and minimum degree of graphs, A cycle of maximum order in a graph of high minimum degree has a chord, Disjoint cycles of different lengths in graphs and digraphs, On color critical graphs with large adaptable chromatic numbers, Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor, Pancyclic graphs and a conjecture of Bondy and Chvatal, Fast probabilistic algorithms for Hamiltonian circuits and matchings, Proof of Komlós's conjecture on Hamiltonian subsets, \(d\)-matching in 3-uniform hypergraphs, On n-extendable graphs, Leaf number and Hamiltonian \(C_4\)-free graphs, One-to-one disjoint path covers in digraphs, Minimum graphs with complete k-closure, Relative lengths of paths and cycles in 3-connected graphs, Graphs with large maximum degree containing no odd cycles of a given length, The matcher game played in graphs, Graphs with certain families of spanning trees, Cycles in bipartite graphs, Maximale Kreise in Graphen, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian, A note on the Ramsey number of even wheels versus stars, On k-path Hamiltonian maximal planar graphs, Erdős-Gallai stability theorem for linear forests, Connectivity of \(k\)-extendable graphs with large \(k\)., Relative lengths of paths and cycles in k-connected graphs, On a tiling conjecture of Komlós for 3-chromatic graphs., Cycles within specified distance from each vertex., HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle, Spanning paths in graphs, Hamiltonicity of claw-free graphs and Fan-type conditions, Rainbow Hamiltonian cycles in strongly edge-colored graphs, Stable properties of graphs, Critical \((P_6, \mathrm{banner})\)-free graphs, Cycles through three vertices in 2-connected graphs, Hamiltonian properties of graphs with large neighborhood unions, A condition for a Hamiltonian bipartite graph to be bipancyclic, Cycles containing many vertices of large degree, Neighborhood unions and a generalization of Dirac's theorem, On vertex-disjoint paths in regular graphs, Chorded pancyclicity in \(k\)-partite graphs, Hamiltonian graphs involving neighborhood intersections, The Ramsey numbers of paths versus wheels, Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen, A method in graph theory, Panconnected graphs. II, Girth 5 graphs from relative difference sets, An Ore-type condition implying a digraph to be pancyclic, A Brooks-type result for sparse critical graphs, A note on 1-factors in certain regular multigraphs, Hamiltonian cycles in regular graphs of moderate degree, On some sequencing problems in finite groups, Hamilton cycles in hypergraphs below the Dirac threshold, Hamilton cycles in regular 2-connected graphs, Sur les cycles élémentaires dans les graphes et hypergraphes k- chromatiques, Selecting and covering colored points, Independent-set reconfiguration thresholds of hereditary graph classes, Long cycles through specified vertices in a graph, Bridges of longest cycles, A generalization of Dirac's theorem for \(K(1,3)\)-free graphs, Proof of the Seymour conjecture for large graphs, Large circuits in binary matroids of large cogirth. II, Irregular networks, regular graphs and integer matrices with distinct row and column sums, Vertices of small degree in uniquely Hamiltonian graphs, Weakly pancyclic graphs, On 2-factors containing 1-factors in bipartite graphs, 2-factors and Hamiltonicity, Design type problems motivated by database theory, A degree condition for the existence of 1-factors in graphs or their complements, Total chromatic number of graphs of odd order and high degree, On the circumferences of regular 2-connected graphs, On the complexity of recognizing tough graphs, A generalization of Ore's Theorem involving neighborhood unions, On the circumference of 3-connected graphs, Extremal problems and generalized degrees, On cycle lengths in graphs of moderate degree, Some sufficient conditions for Hamiltonian property in terms of Wiener-type invariants, On the optimality of Bellman-Ford-Moore shortest path algorithm, Global cycle properties of locally isometric graphs, Global cycle properties in locally connected, locally traceable and locally Hamiltonian graphs, Circumferences of 3-connected claw-free graphs, A sufficient local degree condition for Hamiltonicity in locally finite claw-free graphs, Stability and Ramsey numbers for cycles and wheels, Large degree vertices in longest cycles of graphs. I, On star-wheel Ramsey numbers, On fan-wheel and tree-wheel Ramsey numbers, Minimum implicit degree condition restricted to claws for Hamiltonian cycles, Cycles and matchings in randomly perturbed digraphs and hypergraphs, On a degree sequence analogue of Pósa's conjecture, Local resilience of spanning subgraphs in sparse random graphs, Stability in the Erdős-Gallai theorems on cycles and paths, Induced subgraphs with large degrees at end-vertices for Hamiltonicity of claw-free graphs, Hamiltonian cycles in critical graphs with large maximum degree, Counting and packing Hamilton cycles in dense graphs and oriented graphs, An Ore-type theorem on Hamiltonian square cycles, On the cycle spectrum of cubic Hamiltonian graphs, An implicit degree condition for pancyclicity of graphs, Advanced lower bounds for the circumference, Pan-\(H\)-linked graphs, An implicit degree Ore-condition for pancyclicity of graphs, Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, Precise location of vertices on Hamiltonian cycles, Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs, Dominating circuits in regular matroids, Hamilton cycles in implicit claw-heavy graphs, Ore's condition for completely independent spanning trees, Perfect matchings in 3-partite 3-uniform hypergraphs, A sufficient condition for the existence of an anti-directed 2-factor in a directed graph, Hamiltonian cycles with all small even chords, Entropy bounds for perfect matchings and Hamiltonian cycles, Hamilton cycles in highly connected and expanding graphs, On extremal hypergraphs for Hamiltonian cycles, A survey on Hamilton cycles in directed graphs, Some new bounds on partition critical hypergraphs, Loose Hamilton cycles in hypergraphs, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, A Dirac theorem for trestles, Improved degree conditions for Hamiltonian properties, An implicit degree condition for Hamiltonian graphs, Proper connection of graphs, Endpoint extendable paths in dense graphs, Locating pairs of vertices on Hamiltonian cycles, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Properly colored paths and cycles, Euler index in uncertain graph, A characterization of partial blocks in weighted graphs, On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem, Combinatorial and computational aspects of graph packing and graph decomposition, Ore's conjecture on color-critical graphs is almost true, A generalization of Menger's theorem, An implicit weighted degree condition for heavy cycles, \(\alpha\)-degree closures for graphs, Polynomial-time perfect matchings in dense hypergraphs, On the KŁR conjecture in random graphs, On the perfect matchings of near regular graphs, Best monotone degree conditions for graph properties: a survey, The Ramsey numbers of paths versus wheels: a complete solution, Closing the gap on path-kipas Ramsey numbers, Best monotone degree conditions for binding number and cycle structure, Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs, Chorded cycles, On the Ramsey-goodness of paths, Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability, Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems, A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs, On minimum degree, leaf number, traceability and Hamiltonicity in graphs, Complete graph immersions in dense graphs, Tight cycles and regular slices in dense hypergraphs, Cycles through specified vertices, Applying a condition for a Hamiltonian bipartite graph to be bipancyclic, On the Hamiltonicity of triple systems with high minimum degree, Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs, An approximate Ore-type result for tight Hamilton cycles in uniform hypergraphs, Graphs with integer matching polynomial zeros, A note on degree conditions for traceability in locally claw-free graphs, Forbidding Hamilton cycles in uniform hypergraphs, A note on a cycle partition problem, Graph invariants and large cycles: a survey, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, The spanning connectivity of line graphs, Color-critical graphs have logarithmic circumference, Noncommuting graphs of matrices over semirings, An intermediate value theorem for the arboricities, Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture, Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs, A conjecture of Welsh revisited, Edge-disjoint Hamilton cycles in graphs, A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants, Extending cycles in directed graphs, Note on locating pairs of vertices on Hamiltonian cycles, Heavy cycles in 2-connected triangle-free weighted graphs, Regular augmentation of planar graphs, Long cycles and the codiameter of a graph. I, Extending cycles in graphs, The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small, A basis for the cycle space of a 2-connected graph, The edge-chromatic class of regular graphs of degree 4 and their complements, Some parameters of graph and its complement, A generalization of a result of Häggkvist and Nicoghossian, The Ramsey numbers for cycles versus wheels of odd order, Subgraphs of colour-critical graphs, The Ramsey numbers of large cycles versus wheels, A note on the computation on the k-closure of a graph, Heavy fans, cycles and paths in weighted graphs of large connectivity, On the spanning connectivity of graphs, Toughness and Hamiltonicity in \(k\)-trees, Degree conditions for Hamiltonicity: counting the number of missing edges, A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs, Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs, Cycles and paths through specified vertices in k-connected graphs, The subgraph homeomorphism problem for small wheels, The Ramsey numbers for a cycle of length six or seven versus a clique of order seven, An analogue of Dirac's theorem on circular super-critical graphs, On constructive methods in the theory of colour-critical graphs, 1-factorizing regular graphs of high degree - an improved bound, Neighbourhood unions and Hamiltonian properties in graphs, Subdivision extendibility, Coverings of the vertices of a graph by small cycles, A degree constraint for uniquely Hamiltonian graphs, Algorithms for long paths in graphs, Perfect matchings in 4-uniform hypergraphs, Three results on cycle-wheel Ramsey numbers, Ore-type degree conditions for disjoint path covers in simple graphs, Semi-degree threshold for anti-directed Hamiltonian cycles, The chromatic index of multigraphs that are nearly full, Hamiltonian degree conditions which imply a graph is pancyclic, The Hamilton spaces of Cayley graphs on abelian groups, Some localization theorems on Hamiltonian circuits, Factorizations of regular graphs, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, On covering vertices of a graph by trees, Subdivisions of graphs: A generalization of paths and cycles, Long paths with endpoints in given vertex-subsets of graphs, The Ramsey numbers for stars of even order versus a wheel of order nine, Hamiltonian-connected graphs, An approximate Dirac-type theorem for \(k\)-uniform hypergraphs, On 2-factors with \(k\) components, Proof of the bandwidth conjecture of Bollobás and Komlós, How to avoid using the regularity Lemma: Pósa's conjecture revisited, Ramsey numbers of long cycles versus books or wheels, The \(k\)-dominating cycles in graphs, On extremal weighted digraphs with no heavy paths, Pancyclicity of Hamiltonian and highly connected graphs, Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs, Hamilton \(\ell \)-cycles in uniform hypergraphs, Algorithm for two disjoint long paths in 2-connected graphs, Hamiltonian cycles in Dirac graphs, A clique-covering sufficient condition for hamiltonicity of graphs, Non-separating 2-factors of an even-regular graph, Distributing vertices along a Hamiltonian cycle in Dirac graphs, Cycles through 4 vertices in 3-connected graphs, Ore-type versions of Brooks' theorem, A new sufficient condition for Hamiltonian graphs, Pancyclic graphs and linear forests, Edge disjoint placement of graphs, A fast parallel algorithm for finding Hamiltonian cycles in dense graphs, Dirac-type generalizations concerning large cycles in graphs, Hamilton cycles in claw-heavy graphs, Path transferability of graphs with bounded minimum degree, Triangle packings and 1-factors in oriented graphs, On the spanning fan-connectivity of graphs, A theorem on cycle-wheel Ramsey number, Normal Eulerian clique-covering and hamiltonicity, Structure and recognition of graphs with no 6-wheel subdivision, Locating any two vertices on Hamiltonian cycles in large graphs, Minimum degree of 3-graphs without long linear paths, Hamiltonicity in randomly perturbed hypergraphs, 2-factors with \(k\) cycles in Hamiltonian graphs, The Ramsey numbers for cycles versus wheels of even order, On Hamiltonian cycles and Hamiltonian paths, Minimum path cover in quasi-claw-free graphs, The total chromatic number of regular graphs of high degree, Traceability of line graphs, Trees through specified vertices, Dirac's type sufficient conditions for hamiltonicity and pancyclicity, Ore-type and Dirac-type theorems for matroids, Berge cycles in non-uniform hypergraphs, Hamilton cycles and paths in vertex-transitive graphs-current directions, An application of Tutte's theorem to 1-factorization of regular graphs of high degree, Ore-type conditions implying 2-factors consisting of short cycles, Hamiltonicity in vertex envelopes of plane cubic graphs, A look at cycles containing specified elements of a graph, Stability results on the circumference of a graph, Weighted degrees and heavy cycles in weighted graphs, An Ore-type condition for the existence of two disjoint cycles, Proof of a conjecture of Haeggkvist on cycles and independent edges, Regular graphs and edge chromatic number, Long cycles generate the cycle space of a graph, Long cycles in bipartite graphs, Two theorems on Hamiltonian graphs, New sufficient conditions for cycles in graphs, Relations between parameters of a graph, A generalization of Dirac's theorem, On a conjecture of Bondy, Longest cycles in regular graphs, Minimum degree of a graph and the existence of k-factors, Cutting-plane-based algorithms for two branch vertices related spanning tree problems, An exact formula for all star-kipas Ramsey numbers, Heavy subgraphs, stability and Hamiltonicity, Long paths and cycles in tough graphs, Extremal problems on consecutive \(L(2,1)\)-labelling, Homomorphism theorems for graphs, On Hamiltonian bipartite graphs, On the Hamiltonicity of random bipartite graphs, Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs, Geodesic-pancyclic graphs, An Ore-type analogue of the Sauer-Spencer theorem, The neighborhood union of independent sets and hamiltonicity of graphs, Robust Hamiltonicity of random directed graphs, On the number of cliques in graphs with a forbidden minor, Unnamed Item, The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph, Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles, Bipartite independent number and Hamilton-biconnectedness of bipartite graphs, Hamiltonicity in prime sum graphs, Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs, Stability for vertex cycle covers, A stability version for a theorem of Erdős on nonhamiltonian graphs, Some local-global phenomena in locally finite graphs, Long cycles through specified vertices, On a vertex-edge marking game on graphs, Star-critical Ramsey number of large cycle and book of different orders, Triangle resilience of the square of a Hamilton cycle in random graphs, Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles, Transversals and bipancyclicity in bipartite graph families, Partial degree conditions and cycle coverings in bipartite graphs, Local resilience for squares of almost spanning cycles in sparse random graphs, A greedy algorithm for the social golfer and the Oberwolfach problem, Hyper-Hamiltonicity in graphs: some sufficient conditions, The proper vertex-disconnection of graphs, Stability results for vertex Turán problems in Kneser graphs, On resilience of connectivity in the evolution of random graphs, Some properties of the closed global shadow graphs and their zero forcing number, Gallai-Ramsey number for the union of stars, A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs, Hamilton-connected, vertex-pancyclic and bipartite holes, The Ramsey numbers of trees versus generalized 6-wheels or generalized 7-wheels, Sets of elements that pairwise generate a linear group, Heavy cycles and spanning trees with few leaves in weighted graphs, On the structure of random graphs with constant \(r\)-balls, Degree sequence conditions for a graph to be disjoint path coverable, The Ramsey numbers of wheels versus odd cycles, Long paths and cycles in subgraphs of the cube, Disjoint long cycles in a graph, Recent advances on the Hamiltonian problem: survey III, On prisms, Möbius ladders and the cycle space of dense graphs, On spanning cycles, paths and trees, Long geodesics in subgraphs of the cube, Hamiltonian cycles in Cayley graphs of imprimitive complex reflection groups, Graphs with no 7-wheel subdivision, Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering, On end degrees and infinite cycles in locally finite graphs, Edge-dominating cycles in graphs, New sufficient condition for Hamiltonian graphs, An Ore-type theorem on equitable coloring, On spanning connected graphs, Long cycles containing \(k\)-ordered vertices in graphs, Forbidden subgraphs that imply 2-factors, Degree conditions on claws and modified claws for Hamiltonicity of graphs, The Ramsey numbers of large cycles versus odd wheels, On groups with the Lohse property., Toughness in graphs -- a survey, Tough graphs and Hamiltonian circuits. (Reprint), New local conditions for a graph to be Hamiltonian, Spanning embeddings of arrangeable graphs with sublinear bandwidth, Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers, Random directed graphs are robustly Hamiltonian, Hamilton cycles in quasirandom hypergraphs, Connectivity analysis and construction of cyclically balanced graphs, Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic triangles, On Hamilton's ideals, On the genus and connectivity of Hamiltonian graphs, On the edit distance of powers of cycles, Hamiltonian lines in infinite graphs with few vertices of smll valency, Note on Hamilton circuits and Hamilton paths, Tough graphs and Hamiltonian circuits., Shortness exponents of families of graphs, Minimal colorings for properly colored subgraphs, On long cycles in a 2-connected bipartite graph, Covering cycles and \(k\)-term degree sums, Some degree bounds for the circumference of graphs, The total chromatic number of regular graphs of even order and high degree, A note on 2-factors with two components, Constructions via Hamiltonian theorems, Perfectly relating the domination, total domination, and paired domination numbers of a graph, Existence of two disjoint long cycles in graphs, A fan-type condition for cyclability, Edge cuts leaving components of order at least \(m\), On \(k\)-path pancyclic graphs, Improved sufficient conditions for Hamiltonian properties, \(F\)-factors in hypergraphs via absorption, Degree sum condition for \(k\)-ordered Hamiltonian connected graphs, Wheel and star-critical Ramsey numbers for quadrilateral, Forbidden subgraphs for longest cycles to contain vertices with large degrees, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs, Intersections of cycles in \(k\)-connected graphs, Spanning surfaces in \(3\)-graphs, Hamiltonian fuzzy graphs with application to human trafficking, The Hamiltonian properties in \(K_{1,r}\)-free split graphs, Proper vertex-pancyclicity of edge-colored complete graphs without monochromatic paths of length three, Spanning spiders and light-splitting switches, The Ramsey numbers of stars versus wheels, Dirac-type theorems in random hypergraphs, Toughness, degrees and 2-factors, Characterizing forbidden pairs for relative length of longest paths and cycles, The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\), On Hamiltonicity of regular graphs with bounded second neighborhoods, Long cycles in graphs with prescribed toughness and minimum degree, Degree conditions and cycle extendability, Generalized Turán number for linear forests, A common generalization of Chvátal-Erdös' and Fraisse's sufficient conditions for hamiltonian graphs, Hamiltonicity in balanced \(k\)-partite graphs, Connectivity, traceability and Hamiltonicity, Hamiltonian paths and cycles in some 4-uniform hypergraphs, Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs, Two vertex-disjoint cycles in a graph, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, Maximum properly colored trees in edge-colored graphs, On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences, Total chromatic number of regular graphs of odd order and high degree, Some multi-color Ramsey numbers on stars versus path, cycle or wheel, Long cycles passing through a linear forest, Connectivity of minimum non-5-injectively colorable planar cubic graphs, Sufficient conditions for graphs to be spanning connected, 2-universality in randomly perturbed graphs, Graphs containing every 2-factor, Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs, A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path, Length of longest cycles in a graph whose relative length is at least two, On hyper-Hamiltonicity in graphs, Two sufficient conditions for Hamilton and dominating cycles, Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity, New Ore's type results on hamiltonicity and existence of paths of given length in graphs, A Dirac-type theorem for Berge cycles in random hypergraphs, Note on the longest paths in \(\{ K_{1,4}, K _{1,4 } + e \}\)-free graphs, Color degree sum conditions for properly colored spanning trees in edge-colored graphs, On the \(L(2,1)\)-labelings of amalgamations of graphs, Switch-based Markov chains for sampling Hamiltonian cycles in dense graphs, Circumference of a graph and its distance dominating longest cycles, Rainbow vertex-pancyclicity of strongly edge-colored graphs, Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs, A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture, Star-critical Ramsey numbers involving graphs with long suspended paths, Branch-depth: generalizing tree-depth of graphs, Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs, On Hamiltonian cycles in balanced \(k\)-partite graphs, Linear Turán numbers of acyclic triple systems, Complexity of stability, Generalizations of the classics to spanning connectedness, Maxima of the \(Q\)-index: forbidden odd cycles, \(K_r\)-factors in graphs with low independence number, A localization method in Hamiltonian graph theory, Connectivity of generating graphs of nilpotent groups, Minimum codegree threshold for Hamilton \(\ell\)-cycles in \(k\)-uniform hypergraphs, Spectral analogues of Erdős' theorem on Hamilton-connected graphs, Maxima of the \(Q\)-index: forbidden even cycles, Minimum degree and size conditions for the proper connection number of graphs, Sufficient conditions for a graph to be Hamiltonian, Stars and their \(k\)-Ramsey numbers, Packing triangles in \(K_4\)-free graphs, On path-quasar Ramsey numbers, Turing kernelization for finding long paths in graph classes excluding a topological minor, Properties of \(\pi\)-skew graphs with applications, Navigating between packings of graphic sequences, Properly colored spanning trees in edge-colored graphs, A hybrid heuristic for the maximum dispersion problem, Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs, Random perturbation of sparse graphs, On Hamiltonian Berge cycles in [3-uniform hypergraphs], On the relation of separability, bandwidth and embedding, On Hamiltonian cycles in hypergraphs with dense link graphs, Generalized Turán number of even linear forests, Co-degrees resilience for perfect matchings in random hypergraphs, The relation between Hamiltonian and 1-tough properties of the Cartesian product graphs, Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3, The H-force sets of the graphs satisfying the condition of Ore's theorem, Star-critical Ramsey numbers of cycles versus wheels, Degree sum conditions for Hamiltonian index, Finding long cycles in balanced tripartite graphs: a first step, An Ore-type condition for Hamiltonicity in tough graphs, Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem, Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs, Disjoint cycles and \(2\)-factors with Fan-type condition in a graph, Regular \(K_n\)-free graphs, An analysis of Monte Carlo algorithm for estimating the permanent, Star-critical Ramsey numbers of wheels versus odd cycles, A note on minimum degree condition for Hamilton \((a,b)\)-cycles in hypergraphs, Spectral radius and the 2-power of Hamilton cycle, On a Hamiltonian cycle in which specified vertices are uniformly distributed, On a conjecture of Woodall, Disjoint cycles with partial degree conditions in claw-free graphs, Tight bounds for powers of Hamilton cycles in tournaments, A generalization of a theorem of Nash-Williams, From one to many rainbow Hamiltonian cycles, Inverse Turán numbers, Aligning two fragmented sequences, The number of disjoint perfect matchings in semi-regular graphs, Corrádi and Hajnal's Theorem for Sparse Random Graphs, Monochromatic Cycles in 2-Coloured Graphs, Packing tight Hamilton cycles in 3-uniform hypergraphs, Packing of graphic n-tuples, Minimum degree thresholds for bipartite graph tiling, Closures, cycles, and paths, A note on some embedding problems for oriented graphs, Dirac's theorem for random graphs, Minimum Degrees for Powers of Paths and Cycles, Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem, Circumferences of k-connected graphs involving independence numbers, Combined Degree and Connectivity Conditions for $H$-Linked Graphs, Regular-factors in the complements of partial k-trees, Crux and Long Cycles in Graphs, Unnamed Item, Spanning Cycles Through Specified Edges in Bipartite Graphs, Binding Number, Minimum Degree, and Cycle Structure in Graphs, Hitting Time of Edge Disjoint Hamilton Cycles in Random Subgraph Processes on Dense Base Graphs, A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs, Approximation and Exact Algorithms for Special Cases of Connected f-Factors, On the Structure of Non-Hamiltonian Graphs I, On the product of all nonzero elements of a finite ring, Degree Conditions for Spanning Brooms, A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs, Degree sums of adjacent vertices for traceability of claw-free graphs, Uniformly Connected Graphs — A Survey, Arbitrary Orientations of Hamilton Cycles in Digraphs, Some Hamiltonian Properties of One-Conflict Graphs, Cycles of many lengths in Hamiltonian graphs, Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles, Embedding spanning subgraphs of small bandwidth, Bounded-Degree Spanning Trees in Randomly Perturbed Graphs, Minimum Degree and Dominating Paths, On nonzero component graph of vector spaces over finite fields, d-matching in k-uniform hypergraphs, A study on thek-ordered hamiltonian graphs, Monophonic convexity in weighted graphs, On Degree Sequences Forcing The Square of a Hamilton Cycle, A simple model for the multiple traveling salesmen problem with single depot and multiple sink, Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path, On Hamilton cycles in Erdős‐Rényi subgraphs of large graphs, Tree decompositions of graphs without large bipartite holes, Paths and circuits in graphs: Extreme cases, On maximal paths and circuits of graphs, Binding number and Hamiltonian (g, f)-factors in graphs II, A Rainbow Dirac's Theorem, Going Far from Degeneracy, Dacey Graphs, The bandwidth theorem for locally dense graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Anticritical graphs, On a rainbow version of Dirac's theorem, Covering and tiling hypergraphs with tight cycles, Unnamed Item, Unnamed Item, An Implicit Degree Condition for Cyclability in Graphs, COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH, Embedding Spanning Bipartite Graphs of Small Bandwidth, Maximal circuits of graphs. I, New sufficient condition and Hamiltonian and traceable, A kind of intersection graph of vector space, Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree, Unnamed Item, Unnamed Item, Unnamed Item, An asymptotic version of a conjecture by Enomoto and Ota, Cycles and paths in edge‐colored graphs with given degrees, Some Topics in Graph Theory, On removable circuits in graphs and matroids, Local resilience of almost spanning trees in random graphs, Proof of a tiling conjecture of Komlós, Cycle Extendability of Hamiltonian Strongly Chordal Graphs, Regular Tur\'an numbers, Embedding spanning subgraphs in uniformly dense and inseparable graphs, On certain cycles in graphs, Finding Optimal Solutions With Neighborly Help., Spectral radius and Hamiltonicity of graphs with large minimum degree, Partial Degree Conditions and Cycle Coverings, Long paths and cycles in random subgraphs of graphs with large minimum degree, On relative length of longest paths and cycles, Sprinkling a Few Random Edges Doubles the Power, Almost spanning subgraphs of random graphs after adversarial edge removal, An approximate version of Jackson’s conjecture, Hamiltonicity in random directed graphs is born resilient, Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs, Distributing vertices on Hamiltonian cycles, Turing Kernelization for Finding Long Paths in Graph Classes Excluding a Topological Minor, Embedding Graphs Having Ore-Degree at Most Five, Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs, On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity, Minimum degree conditions for large subgraphs, On size multipartite Ramsey numbers for stars versus paths and cycles, Large degree vertices in longest cycles of graphs II, Maker-Breaker Games on Randomly Perturbed Graphs, Heavy cycles in weighted graphs, Hamiltonian Chains in Hypergraphs, Connectedness strength of two vertices in an uncertain graph, Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs, On the Stability of the Graph Independence Number, A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity, Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs, Counting Hamilton cycles in Dirac hypergraphs, Powers of paths in tournaments, A spanning bandwidth theorem in random graphs, Fractional matching number and spectral radius of nonnegative matrices of graphs, Flots et tensions dans un graphe, Bandwidth, treewidth, separators, expansion, and universality, Embedding clique-factors in graphs with low \(\ell\)-independence number, On the minimum cycle cover problem on graphs with bounded co-degeneracy, Disjoint cycles covering specified vertices in bipartite graphs with partial degrees, Local Dirac's condition on the existence of 2-factor, Ore- and Pósa-type conditions for partitioning 2-edge-coloured graphs into monochromatic cycles, Graph Tilings in Incompatibility Systems, Oriented discrepancy of Hamilton cycles, Rainbow spanning structures in graph and hypergraph systems, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments, High powers of Hamiltonian cycles in randomly augmented graphs, On the path partition number of 6‐regular graphs, Tree embeddings and tree‐star Ramsey numbers, Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection, Cycle lengths in randomly perturbed graphs, Covering cycles in sparse graphs, The number of bounded‐degree spanning trees, On sufficient conditions for spanning structures in dense graphs, Hamiltonicity of graphs perturbed by a random regular graph, On powers of tight Hamilton cycles in randomly perturbed hypergraphs, Minimum degree ensuring that a hypergraph is Hamiltonian-connected, Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs, Rainbow structures in a collection of graphs with degree conditions, Edge coloring graphs with large minimum degree, Minimum degree and the graph removal lemma, Stability version of Dirac's theorem and its applications for generalized Turán problems, Antipaths in oriented graphs, Bonds Intersecting Long Paths in \(k\) -Connected Graphs, Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian, Unnamed Item, A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph, Cyclability, connectivity and circumference, 2-Trees: Structural insights and the study of Hamiltonian paths, Ramsey numbers of large even cycles and fans, Edge-diameter of a graph and its longest cycles, Minimum degree conditions for tight Hamilton cycles, On \((2, k)\)-Hamilton-connected graphs, Hamilton cycles in dense regular digraphs and oriented graphs, Critical (\(P_5\), bull)-free graphs, Some results on \(k\)-critical \(P_5\)-free graphs, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, The Ramsey number of a long even cycle versus a star, Non-Hamiltonian graphs with large minimum degree, Methods for determining cycles of a specific length in undirected graphs with edge weights, Tight bounds for divisible subdivisions, Dirac-type conditions for spanning bounded-degree hypertrees, An Ore-type condition for hamiltonicity in tough graphs and the extremal examples, Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph, An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs, Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs, Unnamed Item, Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree, Unnamed Item, Packing, counting and covering Hamilton cycles in random directed graphs, Unnamed Item, Packing and counting arbitrary Hamilton cycles in random digraphs, Pósa's conjecture for graphs of order at least 2 × 108, Spanning paths and cycles in triangle-free graphs, Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs, Packing, counting and covering Hamilton cycles in random directed graphs, Complexity of Stability., Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian, Fan type condition and characterization of Hamiltonian graphs, An Ore-type condition for cyclability, Degree conditions for weakly geodesic pancyclic graphs and their exceptions, \(k\)-critical graphs in \(P_5\)-free graphs, \(k\)-critical graphs in \(P_5\)-free graphs, On the Saxl graph of a permutation group, Powers of tight Hamilton cycles in randomly perturbed hypergraphs, Universality for bounded degree spanning trees in randomly perturbed graphs, The finite embeddability property for IP loops and local embeddability of groups into finite IP loops, Spanning Trees with Few Branch Vertices, Degree Conditions for Embedding Trees, Global cycle properties in graphs with large minimum clustering coefficient, Dirac's Condition for Spanning Halin Subgraphs, A geometric theory for hypergraph matching, Hamiltonian Extension, Large Book-Cycle Ramsey Numbers, An explicit construction of graphs of bounded degree that are far from being Hamiltonian, Decomposing Graphs of High Minimum Degree into 4‐Cycles, Circumference and Pathwidth of Highly Connected Graphs, On chromatic number of graphs and set-systems
