The following pages link to (Q4373666):
Displaying 12 items.
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- Cyclomatic numbers of planar graphs (Q1377833) (← links)
- On the planarity of cyclic graphs (Q1657785) (← links)
- Planar Turán numbers of cycles: a counterexample (Q2170782) (← links)
- Bounding the number of cycles in a graph in terms of its degree sequence (Q2225410) (← links)
- Estimating the number of short cycles in a simple planar graph (Q2927158) (← links)
- The Even Cycle Problem for Planar Digraphs (Q3141521) (← links)
- Cyclicity of graphs (Q4700530) (← links)
- On the Complexity of Cycle Enumeration for Simple Graphs (Q4979428) (← links)
- On the maximum number of cycles in a planar graph (Q5450351) (← links)
- A direct method for calculating cell cycles of a block map of a simple planar graph (Q5871440) (← links)
- Counting paths, cycles, and blow‐ups in planar graphs (Q6057641) (← links)