Recognizing P₄ -Sparse Graphs in Linear Time
From MaRDI portal
Recognizing $P 4 $-Sparse Graphs in Linear Time
Recommendations
Cited in
(56)- The graph sandwich problem for P₄-sparse graphs
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs
- A tree representation for \(P_ 4\)-sparse graphs
- On semi-\(P_ 4\)-sparse graphs
- Scattering number and modular decomposition
- A fast parallel algorithm to recognize P4-sparse graphs
- On extended P₄-reducible and extended P₄-sparse graphs
- On the structure of graphs with few P₄s
- On variations of \(P_{4}\)-sparse graphs
- Progress on the description of identifying code polyhedra for some families of split graphs
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- The multiple domination and limited packing problems in graphs
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs
- On the \(P_4\)-components of graphs
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Complexity of modification problems for reciprocal best match graphs
- Best match graphs and reconciliation of gene trees with species trees
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs
- Classes of perfect graphs
- The parametric complexity of graph diameter augmentation
- Maximization coloring problems on graphs with few \(P_4\)
- Efficient parallel recognition of cographs
- On the \(b\)-dominating coloring of graphs
- Dot product dimensions of graphs
- Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs
- SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s
- Minimum sum coloring of \(P_{4}\)-sparse graphs
- Polynomial instances of the packing coloring problem
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes
- Pairwise compatibility graphs: a survey
- scientific article; zbMATH DE number 4206028 (Why is no real title available?)
- scientific article; zbMATH DE number 4139767 (Why is no real title available?)
- A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs
- Path-bicolorable graphs. (Extended abstract)
- A fully dynamic algorithm for the recognition of P₄-sparse graphs
- A survey of the algorithmic aspects of modular decomposition
- On graphs with limited number of \(P_{4}\)-partners
- On the clique-width of graph with few \(P_{4}\)'s
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
- On the isomorphism of graphs with few P4s
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
- Path-bicolorable graphs
- Some algorithmic results for eternal vertex cover problem in graphs
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
- Complexity and parameterized algorithms for cograph editing
- 2-polarity and algorithmic aspects of polarity variants on cograph superclasses
- Graph classes with few P₄'s: universality and Brownian graphon limits
- On the minimum sum coloring of P₄-sparse graphs
- Minimal separators in \(P_4\)-sparse graphs
- An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs
- On bipartite graphs with weak density of some subgraphs
- Spiders can be recognized by counting their legs
This page was built for publication: Recognizing $P_4 $-Sparse Graphs in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990660)
