The following pages link to Cycles of even length in graphs (Q1844243):
Displayed 37 items.
- Finding and counting given length cycles (Q675293) (← links)
- The existence of even cycles with specific lengths in Wenger's graph (Q942883) (← links)
- Parity check matrices and product representations of squares (Q949791) (← links)
- Cycle lengths in sparse graphs (Q949802) (← links)
- On the homogeneous algebraic graphs of large girth and their applications (Q1006033) (← links)
- Extremal theory and bipartite graph-tree Ramsey numbers (Q1112065) (← links)
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s (Q1179469) (← links)
- On embedding of graphs into Euclidean spaces of small dimension (Q1204473) (← links)
- On graphs which contain all small trees (Q1245238) (← links)
- Polarities and \(2k\)-cycle-free graphs (Q1292856) (← links)
- On cycle lengths in graphs of moderate degree (Q1322247) (← links)
- Acyclic edge-colorings of sparse graphs (Q1324448) (← links)
- Maximum cuts and judicious partitions in graphs without short cycles (Q1400968) (← links)
- Graphs with large maximum degree containing no odd cycles of a given length (Q1405126) (← links)
- Nearly bipartite graphs (Q1412666) (← links)
- Graph minor hierarchies (Q1764803) (← links)
- Compactness results in extremal graph theory (Q1837701) (← links)
- Pancyclicity of hamiltonian line graphs (Q1842184) (← links)
- Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations (Q1869034) (← links)
- Geometric graphs with no self-intersecting path of length three (Q1883291) (← links)
- Explicit construction of graphs with an arbitrary large girth and of large size (Q1894370) (← links)
- An extremal problem for cycles in hamiltonian graphs (Q1900521) (← links)
- On product representation of powers. I (Q1902964) (← links)
- On monomial graphs of girth eight (Q2467318) (← links)
- Shifted products that are coprime pure powers (Q2484505) (← links)
- A note on short cycles in a hypercube (Q2509296) (← links)
- Multi-color Ramsey numbers of even cycles (Q2519800) (← links)
- Graphs without cycles of even length (Q2730742) (← links)
- Almost all graphs with high girth and suitable density have high chromatic number (Q2746204) (← links)
- General properties of some families of graphs defined by systems of equations (Q2757094) (← links)
- The complete closure of a graph (Q3137765) (← links)
- Turán problems for integer-weighted graphs (Q3150169) (← links)
- Diameters and Eigenvalues (Q3834081) (← links)
- Large cycles in large labelled graphs (Q4060987) (← links)
- On cycle—Complete graph ramsey numbers (Q4163559) (← links)
- A new series of dense graphs of high girth (Q4320744) (← links)
- Four-cycles in graphs without a given even cycle (Q4667796) (← links)