The following pages link to Degree constrained subgraphs (Q2482112):
Displaying 16 items.
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results (Q3602827) (← links)
- Weight choosability of graphs (Q3608322) (← links)
- (Q3728027) (← links)
- (Q3798686) (← links)
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS (Q4903632) (← links)
- On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
- A note on 1-2-3 conjecture for Halin graphs (Q5057739) (← links)
- Graphs with degree constraints (Q5194941) (← links)
- Distant sum distinguishing index of graphs with bounded minimum degree (Q5217057) (← links)
- 3-Regular subgraphs and (3,1)-colorings of 4-regular pseudographs (Q5264756) (← links)
- Total Weight Choosability of Trees (Q5346547) (← links)
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees (Q6081547) (← links)
- On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
- A solution to the 1-2-3 conjecture (Q6196158) (← links)
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment (Q6568836) (← links)
