Pages that link to "Item:Q1390873"

The following pages link to On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873):

Displaying 21 items.

• On realization graphs of degree sequences (Q284753) (← links)
• A fully dynamic algorithm for the recognition of \(P_4\)-sparse graphs (Q441871) (← links)
• Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
• On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
• Structure and stability number of chair-, co-P- and gem-free graphs revisited (Q1007592) (← links)
• Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
• On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
• Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
• Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
• The clique operator on graphs with few \(P_{4}\)'s (Q2489945) (← links)
• Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs (Q2657070) (← links)
• (Q2857318) (← links)
• BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (Q2905308) (← links)
• A representation for the modular-pairs of a P4-reducible graph by modular decomposition (Q3439346) (← links)
• Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
• ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P₄'S (Q5249008) (← links)
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
• Finding houses and holes in graphs (Q5941278) (← links)
• Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← 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)