Pages that link to "Item:Q531598"

The following pages link to On graphs without a \(C_{4}\) or a diamond (Q531598):

Displaying 14 items.

• Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
• Enumerations, forbidden subgraph characterizations, and the split-decomposition (Q668013) (← links)
• Induced subgraph isomorphism: are some patterns substantially easier than others? (Q888440) (← links)
• A fast deterministic detection of small pattern graphs in graphs without large cliques (Q1740697) (← links)
• Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
• Decomposition of directed graphs and the Turán problem (Q2260873) (← links)
• Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
• Map graphs having witnesses of large girth (Q2632022) (← links)
• A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques (Q2980911) (← links)
• (Q5002730) (← links)
• Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
• A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
• Rare siblings speed-up deterministic detection and counting of small pattern graphs (Q5925690) (← links)
• Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)