Pages that link to "Item:Q1281385"
From MaRDI portal
The following pages link to The complexity of some problems related to GRAPH 3-COLORABILITY (Q1281385):
Displaying 27 items.
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142) (← links)
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques (Q629355) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- A note on the computational complexity of graph vertex partition (Q868398) (← links)
- On split-coloring problems (Q995923) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Splitting a graph into disjoint induced paths or cycles. (Q1408827) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Partitioning chordal graphs into independent sets and cliques (Q1827861) (← links)
- On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
- Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
- Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
- Partition the vertices of a graph into one independent set and one acyclic set (Q2497500) (← links)
- Partitioning cographs into cliques and stable sets (Q2568333) (← links)
- Bisplit graphs (Q2568470) (← links)
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
- Characterizing –partitionable Cographs (Q3439349) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Sparse Graphs Are Near-Bipartite (Q5130577) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5918693) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)
