Pages that link to "Item:Q3990660"
From MaRDI portal
The following pages link to Recognizing $P_4 $-Sparse Graphs in Linear Time (Q3990660):
Displaying 50 items.
- A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- An optimal parallel solution for the path cover problem on \(P_{4}\)-sparse graphs (Q868040) (← links)
- On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
- Spiders can be recognized by counting their legs (Q904532) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- On the b-coloring of cographs and \(P_{4}\)-sparse graphs (Q1043801) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873) (← links)
- On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
- Using SPQR-trees to speed up recognition algorithms based on 2-cutsets (Q1752488) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
- Best match graphs and reconciliation of gene trees with species trees (Q2303745) (← links)
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners (Q2344754) (← links)
- 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 (Q2345859) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- The parametric complexity of graph diameter augmentation (Q2446345) (← links)
- Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
- Efficient parallel recognition of cographs (Q2565857) (← links)
- On the \(b\)-dominating coloring of graphs (Q2576347) (← links)
- Dot product dimensions of graphs (Q2636805) (← links)
- Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs (Q2657070) (← links)
- SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s (Q2741323) (← links)
- Minimum sum coloring of \(P_{4}\)-sparse graphs (Q2840552) (← links)
- Polynomial instances of the packing coloring problem (Q2840736) (← links)
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs (Q2883613) (← links)
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes (Q2905308) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- (Q3355252) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- ON GRAPHS WITH LIMITED NUMBER OF P<sub>4</sub>-PARTNERS (Q5248994) (← links)
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S (Q5249008) (← links)
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)
