Graphs with few \(P_4\)'s under the convexity of paths of order three
From MaRDI portal
Publication:491593
DOI10.1016/j.dam.2014.05.005zbMath1319.05077OpenAlexW2020957685MaRDI QIDQ491593
Publication date: 18 August 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.05.005
fixed parameter tractabilityCarathéodory numberhull numberRadon number\((q,q-4)\)-graphsconvexity of paths of order three
Related Items (13)
On the geodetic hull number of \(P_{k}\)-free graphs ⋮ On the \(P_3\)-hull number of some products of graphs ⋮ And/or-convexity: a graph convexity based on processes and deadlock models ⋮ Geodetic Convexity Parameters for Graphs with Few Short Induced Paths ⋮ On the \(P_3\)-hull number of Hamming graphs ⋮ On the monophonic rank of a graph ⋮ Domination and convexity problems in the target set selection model ⋮ The convexity of induced paths of order three and applications: complexity aspects ⋮ Inapproximability results for graph convexity parameters ⋮ Multilevel clustering models and interval convexities ⋮ Geodetic convexity parameters for \((q, q - 4)\)-graphs ⋮ Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs ⋮ The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Confronting intractability via parameters
- Restricted coloring problems on graphs with few \(P_4\)'s
- Irreversible conversion of graphs
- Convex sets in graphs. II: Minimal path convexity
- Comportement périodique des fonctions à seuil binaires et applications
- A tree representation for \(P_ 4\)-sparse graphs
- On triangle path convexity in graphs
- On the structure of graphs with few \(P_4\)s
- Local majorities, coalitions and monopolies in graphs: A review
- On periodical behaviour in societies with symmetric influences
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- On two-path convexity in multipartite tournaments
- Fixed-parameter algorithms for the cocoloring problem
- Maximization coloring problems on graphs with few \(P_4\)
- Parametrized complexity theory.
- Embedding tournaments in simple tournaments
- Some remarks on simple tournaments
- On the Convexity of Paths of Length Two in Undirected Graphs
- On the Radon Number for P 3-Convexity
- Random majority percolation
- Split-Perfect Graphs: Characterizations and Algorithmic Use
- P-Components and the Homogeneous Decomposition of Graphs
- On the Carathéodory Number for the Convexity of Paths of Order Three
- Efficient algorithms for graphs with few \(P_4\)'s
This page was built for publication: Graphs with few \(P_4\)'s under the convexity of paths of order three
