On diameters and radii of bridged graphs
From MaRDI portal
Recommendations
Cites work
- Bridged graphs and geodesic convexity
- Conditions for invariance of set diameters under d-convexification in a graph
- Convexity in Graphs and Hypergraphs
- On bridged graphs and cop-win graphs
- On local convexity in graphs
- On powers and centers of chordal graphs
- On rigid circuit graphs
- On the null-homotopy of bridged graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
Cited in
(62)- Isometric cycles, cutsets, and crowning of bridged graphs
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
- scientific article; zbMATH DE number 7765420 (Why is no real title available?)
- Coloring square-free Berge graphs
- Vertex coloring of graphs with few obstructions
- Bollobás-Erdős-Tuza conjecture for graphs with no induced \(K_{s , t}\)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
- On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
- On covering bridged plane triangulations with balls
- Tree independence number. I. (Even hole, diamond, pyramid)-free graphs
- On efficient domination for some classes of H-free bipartite graphs
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs
- On graphs without a \(C_{4}\) or a diamond
- Dismantlability of weakly systolic complexes and applications
- Maximum regular induced subgraphs in 2P₃-free graphs
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Consequences of an algorithm for bridged graphs
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
- Approximation and kernelization for chordal vertex deletion
- Triangulated neighborhoods in even-hole-free graphs
- Weighted independent sets in classes of \(P_6\)-free graphs
- Blocker size via matching minors
- Solving the clique cover problem on (bull, \(C_4\))-free graphs
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- New results on independent sets in extensions of \(2K_2\)-free graphs
- Independent sets of maximum weight beyond claw-free graphs and related problems
- Bridged graphs and geodesic convexity
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- From matchings to independent sets
- Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems
- Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs
- Parameterized complexity of conflict-free set cover
- New applications of clique separator decomposition for the maximum weight stable set problem
- Towards constant-factor approximation for chordal/distance-hereditary vertex deletion
- Weighted independent sets in a subclass of P₆-free graphs
- A faster algorithm to recognize even-hole-free graphs
- Tent and a subclass of \(P_{5}\)-free graphs
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- Independent domination in finitely defined classes of graphs: polynomial algorithms
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- Hyperbolic bridged graphs
- Structural parameterizations with modulator oblivion
- Counting independent sets in structured graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- On minimal prime extensions of a four-vertex graph in a prime graph
- A Generalization of \chi -Binding Functions
- Wait-free approximate agreement on graphs
- Wait-free approximate agreement on graphs
- A sufficient condition to extend polynomial results for the maximum independent set problem
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs
- A polynomial kernel for distance-hereditary vertex deletion
- Exact and parameterized algorithms for the independent cutset problem
- On the polynomial kernelizations of finding a shortest path with positive disjunctive constraints
- Combinatorial optimization with 2-joins
- Radius versus diameter in cocomparability and intersection graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Coloring (4K₁,C₄,C₆)-free graphs
- Maximum weight independent set for claw-free graphs in polynomial time
- Independent Sets in Classes Related to Chair-Free Graphs
- On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
- A faster algorithm to recognize even-hole-free graphs
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
This page was built for publication: On diameters and radii of bridged graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1117245)
