Pages that link to "Item:Q1392556"
From MaRDI portal
The following pages link to On the structure of graphs with few \(P_4\)s (Q1392556):
Displaying 29 items.
- Some links between identifying codes and separating, dominating and total dominating sets in graphs (Q324774) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Graphs with few \(P_4\)'s under the convexity of paths of order three (Q491593) (← links)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
- Grundy dominating sequences on \(X\)-join product (Q777371) (← links)
- The micro-world of cographs (Q831855) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- Clique-width of partner-limited graphs (Q1422439) (← links)
- Total dominating sequences in trees, split graphs, and under modular decomposition (Q1662158) (← links)
- Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s (Q1751152) (← links)
- \(2K_2\)-partition of some classes of graphs (Q1759842) (← links)
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
- Geodetic convexity parameters for \((q, q - 4)\)-graphs (Q2030436) (← links)
- A de Bruijn-Erdős theorem for \((q,q-4)\)-graphs (Q2181233) (← links)
- Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs (Q2323491) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
- Hardness and inapproximability of convex recoloring problems (Q2446103) (← links)
- Maximization coloring problems on graphs with few \(P_4\) (Q2448891) (← links)
- On the geodetic hull number of \(P_{k}\)-free graphs (Q2629231) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results (Q2827810) (← links)
- Restricted coloring problems on graphs with few (Q2840684) (← links)
- (Q2857318) (← links)
- The A4-structure of a graph (Q2911060) (← links)
- Counting Spanning Trees in Graphs Using Modular Decomposition (Q3078398) (← links)
- Geodetic Convexity Parameters for Graphs with Few Short Induced Paths (Q3181044) (← links)
