Pages that link to "Item:Q3265306"

The following pages link to On maximal paths and circuits of graphs (Q3265306):

Displaying 50 items.

• Cycles avoiding a color in colorful graphs (Q2800592) (← links)
• A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (Q2811158) (← links)
• Coloring powers and girth (Q2827489) (← links)
• Hypergraphs with no odd cycle of given length (Q2851489) (← links)
• Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number (Q2857389) (← links)
• Hypergraph extensions of the Erdős-Gallai theorem (Q2883632) (← links)
• Monochromatic cycles in 2-coloured graphs (Q2883852) (← links)
• On the maximum number of edges in a triple system not containing a disjoint family of a given size (Q2883857) (← links)
• The maximum number of triangles in \(C_{2k+1}\)-free graphs (Q2883861) (← links)
• Hypergraphs with no cycle of a given length (Q2883862) (← links)
• Edge colourings of graphs avoiding monochromatic matchings of a given size (Q2883863) (← links)
• The size of a hypergraph and its matching number (Q2888870) (← links)
• Ramsey numbers for trees (Q2907031) (← links)
• Compact topological minors in graphs (Q3005115) (← links)
• The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle (Q3068812) (← links)
• Turán Numbers of Multiple Paths and Equibipartite Forests (Q3103631) (← links)
• On the multi-colored Ramsey numbers of cycles (Q3113287) (← links)
• Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture (Q3178439) (← links)
• Paths and circuits in graphs: Extreme cases (Q3265305) (← links)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• A Conjecture of Verstraëte on Vertex-Disjoint Cycles (Q3300756) (← links)
• Monochromatic Cycle Partitions in Local Edge Colorings (Q3466360) (← links)
• Maximal circuits of graphs. I (Q4103567) (← links)
• Ramsey Size Linear Graphs (Q4290091) (← links)
• Monophonic convexity in weighted graphs (Q4603877) (← links)
• Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
• A Local Approach to the Erdös--Sós Conjecture (Q4631099) (← links)
• An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs (Q4920655) (← links)
• MAXIMUM CUTS IN GRAPHS WITHOUT WHEELS (Q4968449) (← links)
• The Turàn number of the graph 3P4 (Q4980028) (← links)
• Spectral radius and Hamiltonian properties of graphs (Q4981977) (← links)
• A note on the Tur\'an number of a Berge odd cycle (Q4990118) (← links)
• The spectral radius of graphs without trees of diameter at most four (Q4992649) (← links)
• Avoiding long Berge cycles: the missing cases <i>k</i> = <i>r</i> + 1 and <i>k</i> = <i>r</i> + 2 (Q4993098) (← links)
• Spectral conditions for traceability of connected claw-free graphs (Q5031878) (← links)
• A Stability Result on Matchings in 3-Uniform Hypergraphs (Q5043638) (← links)
• A note on fractional covers of a graph (Q5058159) (← links)
• Counting <i>H</i>-free orientations of graphs (Q5058452) (← links)
• (Q5075790) (← links)
• The Turán number of the graph 3P5 (Q5081188) (← links)
• On Generalized Turán Results in Height Two Posets (Q5088600) (← links)
• Maximum and Minimum Degree Conditions for Embedding Trees (Q5128507) (← links)
• Going Far from Degeneracy (Q5130907) (← links)
• Nearly-Regular Hypergraphs and Saturation of Berge Stars (Q5210978) (← links)
• Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← links)
• Extensions of the Erdős–Gallai theorem and Luo’s theorem (Q5222574) (← links)
• Hypergraphs Not Containing a Tight Tree with a Bounded Trunk (Q5232133) (← links)
• Degree Conditions for Embedding Trees (Q5232383) (← links)
• Cycle packing (Q5256386) (← links)
• The Monochromatic Circumference of 2‐Edge‐Colored Graphs (Q5272638) (← links)