Pages that link to "Item:Q1897361"

The following pages link to Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361):

Displaying 21 items.

• Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
• Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
• Minimal separators in \(P_4\)-sparse graphs (Q819831) (← 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)
• Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
• Bi-complement reducible graphs (Q1356114) (← 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 variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
• On the \(b\)-continuity of the lexicographic product of graphs (Q1684933) (← links)
• Graphs with small fall-spectrum (Q1720325) (← links)
• The clique operator on cographs and serial graphs (Q1827743) (← links)
• Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
• On some domination colorings of graphs (Q2399288) (← links)
• Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
• (Q2741323) (← links)
• Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
• Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)
• On the hull number on cycle convexity of graphs (Q6072203) (← links)