Pages that link to "Item:Q5450351"

The following pages link to On the maximum number of cycles in a planar graph (Q5450351):

Displaying 20 items.

• The maximum number of minimal codewords in an \([n,k]\)-code (Q389190) (← links)
• On graphs with many cycles (Q397129) (← links)
• Cycle-maximal triangle-free graphs (Q472981) (← links)
• Triangle-free graphs with the maximum number of cycles (Q898130) (← links)
• Cyclomatic numbers of planar graphs (Q1377833) (← links)
• On the planarity of cyclic graphs (Q1657785) (← links)
• The number of circles of a maximum state of a plane graph with applications (Q2025183) (← links)
• Bounding the number of cycles in a graph in terms of its degree sequence (Q2225410) (← links)
• The maximum number of cycles in a graph with fixed number of edges (Q2278119) (← links)
• Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs (Q2308511) (← links)
• The maximum number of paths of length four in a planar graph (Q2659227) (← links)
• Estimating the number of short cycles in a simple planar graph (Q2927158) (← links)
• The prism-free planar graphs and their cycles bases (Q3980625) (← links)
• (Q4373666) (← links)
• Primitive polycycles: a criterion (Q4515808) (← links)
• Cyclicity of graphs (Q4700530) (← links)
• On the maximum number of cycles in outerplanar and series-parallel graphs (Q5891226) (← links)
• On the maximum number of cycles in outerplanar and series-parallel graphs (Q5917852) (← links)
• On the maximum number of edges in planar graphs of bounded degree and matching number (Q6041557) (← links)
• Connected cubic graphs with the maximum number of perfect matchings (Q6057662) (← links)