Pages that link to "Item:Q947111"
From MaRDI portal
The following pages link to Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111):
Displaying 12 items.
- Corrigendum to ``Cycle transversals in perfect graphs and cographs'' (Q387014) (← links)
- Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592) (← links)
- Structured proportional representation (Q1686072) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Bounded clique cover of some sparse graphs (Q2359963) (← links)
- On the tractability of finding disjoint clubs in a network (Q2422030) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- Art gallery problem with rook and queen vision (Q2657110) (← links)
- Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes (Q2945667) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
- Decomposing subcubic graphs into claws, paths or triangles (Q6056758) (← links)