Pages that link to "Item:Q2718334"
From MaRDI portal
The following pages link to On powers of chordal graphs and their colorings (Q2718334):
Displaying 22 items.
- A linear time algorithm to compute square of interval graphs and their colouring (Q322053) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- The square of a block graph (Q965949) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- Chromatic sets of power graphs and their application to resource placement in multicomputer networks (Q980032) (← links)
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
- On strongly chordal graphs that are not leaf powers (Q1687937) (← links)
- Colouring exact distance graphs of chordal graphs (Q2305897) (← links)
- Complexity of finding graph roots with girth conditions (Q2428666) (← links)
- Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
- Strongly simplicial vertices of powers of trees (Q2455590) (← links)
- Labeling planar graphs with a condition at distance two (Q2461777) (← links)
- A survey on labeling graphs with a condition at distance two (Q2497501) (← links)
- Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems (Q3467873) (← links)
- Coloring Powers of Chordal Graphs (Q5317560) (← links)
- Convex Recoloring Revisited: Complexity and Exact Algorithms (Q5323087) (← links)
- On Injective Colourings of Chordal Graphs (Q5458556) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6589843) (← links)
