The following pages link to (Q3836509):
Displaying 48 items.
- An \(O(n)\) time algorithm for maximum matching in \(P_{4}\)-tidy graphs (Q287094) (← links)
- Some links between identifying codes and separating, dominating and total dominating sets in graphs (Q324774) (← links)
- The cluster deletion problem for cographs (Q394219) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs (Q617902) (← links)
- Partial characterizations of circle graphs (Q643006) (← links)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
- \(P_{4}\)-laden graphs: A new class of brittle graphs (Q1349998) (← links)
- Matroids arisen from matrogenic graphs (Q1356745) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- On variations of \(P_{4}\)-sparse graphs (Q1406046) (← links)
- Clique-width of partner-limited graphs (Q1422439) (← links)
- Total dominating sequences in trees, split graphs, and under modular decomposition (Q1662158) (← links)
- \(b\)-coloring of tight graphs (Q1759847) (← links)
- Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- Hitting subgraphs in \(P_4\)-tidy graphs (Q2010691) (← links)
- Edge tree spanners (Q2056906) (← links)
- On some special classes of contact \(B_0\)-VPG graphs (Q2064288) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Generalized limited packings of some graphs with a limited number of \(P_4\)-partners (Q2344754) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- On graphs with a single large Laplacian eigenvalue (Q2413188) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- The clique operator on graphs with few \(P_{4}\)'s (Q2489945) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s (Q2741323) (← links)
- Minimal separators in \(P_4\)-tidy graphs (Q2840517) (← links)
- Restricted coloring problems on graphs with few \(P'_4s\) (Q2840684) (← links)
- Probe interval and probe unit interval graphs on superclasses of cographs (Q2840732) (← links)
- The \(k\)-limited packing and \(k\)-tuple domination problems in strongly chordal, \(P_{4}\)-tidy and split graphs (Q2883613) (← links)
- Counting Spanning Trees in Graphs Using Modular Decomposition (Q3078398) (← links)
- On -sparse graphs and other families (Q3439147) (← links)
- (Q4691781) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
- On minimal forbidden subgraph characterizations of balanced graphs (Q5891090) (← 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)
- Partitioning \(P_4\)-tidy graphs into a stable set and a forest (Q6166038) (← links)
