Pages that link to "Item:Q5734435"
From MaRDI portal
The following pages link to On the maximal number of independent circuits in a graph (Q5734435):
Displaying 19 items.
- On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
- Disjoint cycles in digraphs (Q595675) (← links)
- The \((2k-1)\)-connected multigraphs with at most \(k-1\) disjoint cycles (Q1705804) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- On the minors of an incidence matrix and Smith normal form (Q1805203) (← links)
- Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
- On the number of independent chorded cycles in a graph (Q2519839) (← links)
- The point-arboricity of a graph (Q2529589) (← links)
- Bounding the number of circuits of a graph (Q2563510) (← links)
- On maximal paths and circuits of graphs (Q3265306) (← links)
- A Sharp Dirac–Erdős Type Bound for Large Graphs (Q4635509) (← links)
- Strengthening Theorems of Dirac and Erdős on Disjoint Cycles (Q4978446) (← links)
- Maximum cycle packing using SPR-trees (Q5009941) (← links)
- Filtered matchings and simplicial complexes (Q5080926) (← links)
- On Independent Circuits Contained in a Graph (Q5338790) (← links)
- On the maximal number of disjoint circuits of a graph (Q5342984) (← links)
- (Q5668493) (← links)
- On the maximal number of independent circuits in a graph (Q5728985) (← links)
- Rooted prism-minors and disjoint cycles containing a specified edge (Q6162146) (← links)
