Pages that link to "Item:Q3136612"
From MaRDI portal
The following pages link to Domination on Cocomparability Graphs (Q3136612):
Displaying 50 items.
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- Induced subgraph isomorphism on proper interval and bipartite permutation graphs (Q476868) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- Graphs of linear clique-width at most 3 (Q719287) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Efficient algorithms for the minimum connected domination on trapezoid graphs (Q881872) (← links)
- On the intersection of tolerance and cocomparability graphs (Q896656) (← links)
- On end-vertices of lexicographic breadth first searches (Q968161) (← links)
- Hardness and approximation of minimum distortion embeddings (Q991793) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- The complexity of domination problems in circle graphs (Q1209148) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Dominations in trapezoid graphs (Q1342259) (← links)
- Parallel algorithms for the domination problems in trapezoid graphs (Q1356505) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- Proper and unit bitolerance orders and graphs (Q1381846) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs (Q1752498) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- A vertex ordering characterization of simple-triangle graphs (Q1800397) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Connected domination and dominating clique in trapezoid graphs (Q1962037) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs (Q1979871) (← links)
- Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets (Q2088073) (← links)
- Happy set problem on subclasses of co-comparability graphs (Q2154092) (← links)
- Perfect elimination orderings for symmetric matrices (Q2174877) (← links)
- Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- Complexity of the improper twin edge coloring of graphs (Q2409501) (← links)
- Improved bottleneck domination algorithms (Q2499580) (← links)
- The hub number of co-comparability graphs (Q2514123) (← links)
- Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- On the power of graph searching for cocomparability graphs (Q2801333) (← links)
- New geometric representations and domination problems on tolerance and multitolerance graphs (Q2820855) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- Connected Domination (Q3384607) (← links)
- Graphs of Linear Clique-Width at Most 3 (Q3502658) (← links)
