Pages that link to "Item:Q627538"
From MaRDI portal
The following pages link to Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538):
Displaying 16 items.
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Distance three labelings of trees (Q415278) (← links)
- \(L(2, 1)\)-labelling of graphs with few \(P_4\)'s (Q1751152) (← links)
- On the number of 2-packings in a connected graph (Q1761463) (← links)
- Star-factors in graphs with large minimum degree (Q1791704) (← links)
- On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs (Q1944116) (← links)
- Channel assignment via fast zeta transform (Q1944122) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- Spanning trees without adjacent vertices of degree 2 (Q2329190) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Exact algorithm for graph homomorphism and locally injective graph homomorphism (Q2446599) (← links)
- Determining the \(L(2,1)\)-span in polynomial space (Q2446848) (← links)
- On Improved Exact Algorithms for L(2,1)-Labeling of Graphs (Q3000491) (← links)
- Fast Exact Algorithm for L(2,1)-Labeling of Graphs (Q3010388) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
