Domination on Cocomparability Graphs
From MaRDI portal
Publication:3136612
Recommendations
Cited in
(71)- The LexCycle on \(\overline{P_2\cup P_3} \)-free cocomparability graphs
- Diametral path graphs
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
- Independent set under a change constraint from an initial solution
- Graphs with at most two moplexes
- Happy set problem on subclasses of co-comparability graphs
- On the kernel and related problems in interval digraphs
- Complexity of the improper twin edge coloring of graphs
- On the cubicity of AT-free graphs and circular-arc graphs
- Domination and total domination on asteroidal triple-free graphs
- A vertex ordering characterization of simple-triangle graphs
- Hardness and approximation of minimum distortion embeddings
- The hub number of co-comparability graphs
- Cubicity and bandwidth
- New geometric representations and domination problems on tolerance and multitolerance graphs
- Vertex ordering characterizations of graphs of bounded asteroidal number
- Algorithms on Subtree Filament Graphs
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- Minimal triangulations of graphs: a survey
- A new LBFS-based algorithm for cocomparability graph recognition
- Max point-tolerance graphs
- Coloring squares of graphs via vertex orderings
- On the independent dominating set polytope
- A survey of selected recent results on total domination in graphs
- On dominating set polyhedra of circular interval graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Graphs of linear clique-width at most 3
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs
- On linear and circular structure of (claw, net)-free graphs
- Weighted independent perfect domination on cocomparability graphs
- Fast diameter computation within split graphs
- A linear time algorithm to compute a dominating path in an AT-free graph
- On the power of graph searching for cocomparability graphs
- Some advances on the set covering polyhedron of circulant matrices
- Graphs vertex-partitionable into strong cliques
- Happy set problem on subclasses of co-comparability graphs
- Small \(k\)-pyramids and the complexity of determining \(k\)
- Dominations in trapezoid graphs
- Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs
- One-node cutsets and the dominating set polytope
- A linear-time algorithm for maximum-cardinality matching on cocomparability graphs
- Connected domination and dominating clique in trapezoid graphs
- Parallel algorithms for the domination problems in trapezoid graphs
- Perfect elimination orderings for symmetric matrices
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- Independent domination in finitely defined classes of graphs
- Asteroidal triple-free graphs
- The complexity of domination problems in circle graphs
- Weighted domination on cocomparability graphs
- Efficient algorithms for the minimum connected domination on trapezoid graphs
- Graphs of Linear Clique-Width at Most 3
- On the intersection of tolerance and cocomparability graphs
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs
- Proper and unit bitolerance orders and graphs
- Connected domination
- Improved bottleneck domination algorithms
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
- Weighted domination of cocomparability graphs
- On end-vertices of lexicographic breadth first searches
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Maximum induced matching algorithms via vertex ordering characterizations
- On total \(f\)-domination: polyhedral and algorithmic results
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs
- Maximum induced matching algorithms via vertex ordering characterizations
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Graph classes and forbidden patterns on three vertices
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
This page was built for publication: Domination on Cocomparability Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136612)
