The following pages link to Degree constrained subgraphs (Q2482112):
Displaying 26 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Group sum chromatic number of graphs (Q268265) (← links)
- Total edge irregularity strength of generalized prism (Q272396) (← links)
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← links)
- 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)
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Total weight choosability of Mycielski graphs (Q512875) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← 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)
- A note on the weak \((2,2)\)-conjecture (Q1625809) (← links)
- Colourings of graphs by labellings (Q1687834) (← links)
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree (Q1696532) (← links)
- On offset Hamilton cycles in random hypergraphs (Q1701116) (← links)
- A note on asymptotically optimal neighbour sum distinguishing colourings (Q1715623) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs (Q2008185) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz (Q5962524) (← links)
