The following pages link to Maximal circuits of graphs. I (Q4103567):
Displaying 44 items.
- On some three-color Ramsey numbers for paths (Q266822) (← links)
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Ramsey numbers for theta graphs (Q666520) (← links)
- Cycles in 2-connected graphs (Q705891) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- Dense arbitrarily partitionable graphs (Q907823) (← links)
- On some three color Ramsey numbers for paths and cycles (Q1044932) (← links)
- Long cycles in bipartite graphs (Q1059086) (← links)
- Long cycles in subgraphs with prescribed minimum degree (Q1183969) (← links)
- Maximal cycles in graphs (Q1185084) (← links)
- The maximum number of cliques in graphs without long cycles (Q1682216) (← links)
- Stability in the Erdős-Gallai theorem on cycles and paths. II (Q1709520) (← links)
- Graphs with almost all edges in long cycles (Q1756098) (← links)
- Minimum degree and size conditions for the proper connection number of graphs (Q2010690) (← links)
- Inverting the Turán problem with chromatic number (Q2037594) (← links)
- Conflict-free connection number and size of graphs (Q2051890) (← links)
- Extremal graphs for the distinguishing index (Q2142642) (← links)
- The proper 2-connection number and size of graphs (Q2166240) (← links)
- On \(r\)-uniform hypergraphs with circumference less than \(r\) (Q2309554) (← links)
- On 2-connected hypergraphs with no long cycles (Q2335701) (← links)
- Dense on-line arbitrarily partitionable graphs (Q2357776) (← links)
- A subexponential algorithm for the coloured tree partition problem (Q2370434) (← links)
- Proper connection and size of graphs (Q2401802) (← links)
- The codiameter of a 2-connected graph (Q2463471) (← links)
- Cycles and stability (Q2464153) (← links)
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- Stability of Woodall's theorem and spectral conditions for large cycles (Q2692178) (← links)
- Spectral radius and Hamiltonian properties of graphs (Q4981977) (← links)
- (Q4986848) (← links)
- Spectral radius and Hamiltonian properties of graphs, II (Q5133410) (← links)
- Extensions of the Erdős–Gallai theorem and Luo’s theorem (Q5222574) (← links)
- Extremal Numbers for Odd Cycles (Q5364245) (← links)
- On mixed Ramsey numbers (Q5917806) (← links)
- Ordering \(Q\)-indices of graphs: given size and circumference (Q6056721) (← links)
- The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
- Exact bipartite Turán numbers of large even cycles (Q6080869) (← links)
- (1, 2)-rainbow connection number at most 3 in connected dense graphs (Q6090318) (← links)
- The Number of Cliques in Graphs Covered by Long Cycles (Q6098464) (← links)
- On the saturation spectrum of families of cycle subdivisions (Q6159028) (← links)
- The maximum number of cliques in graphs with prescribed order, circumference and minimum degree (Q6171501) (← links)
- Non-Hamiltonian graphs with large minimum degree (Q6178660) (← links)
- Maximizing the degree powers of graphs with fixed size (Q6180639) (← links)
- How connectivity affects the extremal number of trees (Q6500097) (← links)
- Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)
