Pages that link to "Item:Q491593"

The following pages link to Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593):

Displaying 13 items.

• Inapproximability results for graph convexity parameters (Q496002) (← links)
• On the \(P_3\)-hull number of some products of graphs (Q1634756) (← links)
• And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) (← links)
• The convexity of induced paths of order three and applications: complexity aspects (Q1701089) (← links)
• Multilevel clustering models and interval convexities (Q1786870) (← links)
• Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
• On the \(P_3\)-hull number of Hamming graphs (Q2185729) (← links)
• On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
• Domination and convexity problems in the target set selection model (Q2689641) (← links)
• The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results (Q2827810) (← links)
• Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
• Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs (Q5890507) (← links)
• On the monophonic rank of a graph (Q6045452) (← links)