Pages that link to "Item:Q3476849"
From MaRDI portal
The following pages link to <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs (Q3476849):
Displaying 43 items.
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
- Spiders can be recognized by counting their legs (Q904532) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- On a unique tree representation for \(P_ 4\)-extendible graphs (Q1182318) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← 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)
- Tree-like \(P_4\)-connected graphs (Q1584426) (← links)
- Total dominating sequences in trees, split graphs, and under modular decomposition (Q1662158) (← links)
- \(b\)-coloring of tight graphs (Q1759847) (← links)
- A simple linear time algorithm for cograph recognition (Q1764804) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- Hamiltonicity in graphs with few \(P_ 4\)'s (Q1805009) (← links)
- Isomorphism of chordal (6, 3) graphs (Q1893148) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)
- An optimal path cover algorithm for cographs (Q1903198) (← links)
- \(N\)-extendible posets, and how to minimize total weighted completion time (Q1962041) (← links)
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs (Q2323491) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- The clique operator on graphs with few \(P_{4}\)'s (Q2489945) (← links)
- Bull-Reducible Berge Graphs are Perfect (Q3438957) (← links)
- A representation for the modular-pairs of a P4-reducible graph by modular decomposition (Q3439346) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- The perfection and recognition of bull-reducible Berge graphs (Q4680732) (← links)
- (Q4691781) (← links)
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S (Q5249008) (← links)
- Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
