scientific article; zbMATH DE number 4045800
From MaRDI portal
Publication:3783331
Recommendations
Cited in
(27)- Distances in cocomparability graphs and their powers
- Duchet-type theorems for powers of HHD-free graphs
- Powers of geometric intersection graphs and dispersion algorithms
- Interval numbers of powers of block graphs
- Induced matchings in intersection graphs.
- Powers of distance-hereditary graphs
- On powers of m-trapezoid graphs
- On powers of circular arc graphs and proper circular arc graphs
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- Polynomial time algorithm for k-vertex-edge dominating problem in interval graphs
- Edge ideals of squares of trees
- Chronological rectangle digraphs which are two-terminal series-parallel
- Distance-\(d\) independent set problems for bipartite and chordal graphs
- Graphs whose complement and square are isomorphic
- Structural properties of word representable graphs
- Distributed minimum vertex coloring and maximum independent set in chordal graphs
- Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs
- Gene clusters as intersections of powers of paths
- Graphs whose powers are chordal and graphs whose powers are interval graphs
- A linear time algorithm to compute square of interval graphs and their colouring
- Max point-tolerance graphs
- A new LBFS-based algorithm for cocomparability graph recognition
- Powers of Hamiltonian paths in interval graphs
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
- The k edge-vertex domination problem
- The k-th Roman domination problem is polynomial on interval graphs
- The edge-vertex domination and weighted edge-vertex domination problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783331)
