The following pages link to Degree constrained subgraphs (Q2482112):
Displayed 16 items.
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Distant irregularity strength of graphs (Q394284) (← links)
- Computation of lucky number of planar graphs is NP-hard (Q413250) (← links)
- On the approximability of some degree-constrained subgraph problems (Q444431) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- Coloring chip configurations on graphs and digraphs (Q763476) (← links)
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260) (← links)
- Lucky labelings of graphs (Q989579) (← links)
- On vertex-coloring 13-edge-weighting (Q1001315) (← links)
- Edge irregular total labellings for graphs of linear size (Q1043545) (← links)
- The edge-labeling and vertex-colors of \(K_n\) (Q2391759) (← links)
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Weight choosability of graphs (Q3608322) (← links)
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS (Q4903632) (← links)