Pages that link to "Item:Q1910543"

The following pages link to A new bound on the feedback vertex sets in cubic graphs (Q1910543):

Displaying 12 items.

• A lower bound on the order of the largest induced forest in planar graphs with high girth (Q317411) (← links)
• Constraint bipartite vertex cover: simpler exact algorithms and implementations (Q431922) (← links)
• Maximum genus and girth of graphs (Q1297489) (← links)
• Maximum genus, girth and connectivity (Q1580675) (← links)
• New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
• Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
• Feedback vertex sets in cubic multigraphs (Q2515555) (← links)
• The <i>k</i>-conversion number of regular graphs (Q4956206) (← links)
• A lower bound on the $k$-conversion number of graphs of maximum degree $k+1$ (Q5135732) (← links)
• (Q5197598) (← links)
• Induced forests in some distance-regular graphs (Q6153467) (← links)
• Splitting plane graphs to outerplanarity (Q6636997) (← links)