Pages that link to "Item:Q1117245"
From MaRDI portal
The following pages link to On diameters and radii of bridged graphs (Q1117245):
Displaying 50 items.
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- On graphs without a \(C_{4}\) or a diamond (Q531598) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- On minimal prime extensions of a four-vertex graph in a prime graph (Q704276) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- Radius versus diameter in cocomparability and intersection graphs (Q1356529) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs (Q1414592) (← links)
- Blocker size via matching minors (Q1637141) (← links)
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- Weighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphs (Q1801055) (← links)
- Consequences of an algorithm for bridged graphs (Q1827690) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion (Q2149107) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- On efficient domination for some classes of \(H\)-free bipartite graphs (Q2334041) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- From matchings to independent sets (Q2403787) (← links)
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110) (← links)
- Solving the clique cover problem on (bull, \(C_4\))-free graphs (Q2414459) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- Independent Sets in Classes Related to Chair-Free Graphs (Q2795949) (← links)
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- (Q5009491) (← links)
- On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs (Q5417820) (← links)
- Dismantlability of weakly systolic complexes and applications (Q5496629) (← links)
- (Q5743476) (← links)
- A polynomial kernel for distance-hereditary vertex deletion (Q5918311) (← links)
- Parameterized complexity of conflict-free set cover (Q5918356) (← links)
- Wait-free approximate agreement on graphs (Q5918635) (← links)
- Wait-free approximate agreement on graphs (Q5925616) (← links)
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs (Q6057651) (← links)
- (Q6065472) (← links)
