Pages that link to "Item:Q5342984"

The following pages link to On the maximal number of disjoint circuits of a graph (Q5342984):

Displaying 50 items.

• Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
• Chordal editing is fixed-parameter tractable (Q300460) (← links)
• Scattered packings of cycles (Q306707) (← links)
• Approximate min-max relations on plane graphs (Q358640) (← links)
• The Erdős-Pósa property for clique minors in highly connected graphs (Q412171) (← links)
• A note on disjoint cycles (Q413261) (← links)
• Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
• On feedback vertex set: new measure and new structures (Q494933) (← links)
• Graphs without two vertex-disjoint \(S\)-cycles (Q785795) (← links)
• The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces (Q868342) (← links)
• Disjoint unions of complete minors (Q941374) (← links)
• Packing edge-disjoint cycles in graphs and the cyclomatic number (Q968414) (← links)
• Packing disjoint cycles over vertex cuts (Q973127) (← links)
• Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458) (← links)
• Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
• Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
• Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
• A generalization of Talbot's theorem about King Arthur and his knights of the round table (Q1024989) (← links)
• Linear connectivity forces large complete bipartite minors (Q1026000) (← links)
• The total chromatic number of regular graphs of high degree (Q1042999) (← links)
• Edge-disjoint circuits in graphs on the torus (Q1210581) (← links)
• A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
• Total chromatic number of graphs of odd order and high degree (Q1301827) (← links)
• Totally critical even order graphs (Q1306315) (← links)
• Disjoint cocircuits in matroids with large rank (Q1405119) (← links)
• The total chromatic number of graphs of even order and high degree (Q1408886) (← links)
• A condition for a graph to contain \(k\)-matching. (Q1422440) (← links)
• Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
• Efficient enumeration of graph orientations with sources (Q1647832) (← links)
• The confirmation of a conjecture on disjoint cycles in a graph (Q1660280) (← links)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
• The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs (Q1748270) (← links)
• On the minors of an incidence matrix and Smith normal form (Q1805203) (← links)
• Maximum graphs not spannable by \(r\) disjoint paths (Q1808830) (← links)
• Nearly sign-nonsingular matrices (Q1893090) (← links)
• On independent cycles and edges in graphs (Q1910587) (← links)
• The number of circles of a maximum state of a plane graph with applications (Q2025183) (← links)
• Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
• Disjoint complete minors and bipartite minors (Q2372437) (← links)
• Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids (Q2384806) (← links)
• A tight Erdős-Pósa function for long cycles (Q2396891) (← links)
• Minimum degree conditions for vertex-disjoint even cycles in large graphs (Q2439893) (← links)
• Non-zero disjoint cycles in highly connected group labelled graphs (Q2490257) (← links)
• Bounding the number of circuits of a graph (Q2563510) (← links)
• The total chromatic number of regular graphs of even order and high degree (Q2570116) (← links)
• Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
• Disjoint even cycles packing (Q2851449) (← links)
• On maximal paths and circuits of graphs (Q3265306) (← links)
• Non-zero disjoint cycles in highly connected group labeled graphs (Q3439347) (← links)
• Note on independent sets of a graph (Q4321837) (← links)